백준51 C++ 14501 퇴사 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 #include #include #include #include using namespace std; int main() { int n; cin >> n; vector aa(18); vector dp(n + 20,0); for (int i = 1; i > aa[i].first >> aa[i].second; } int result = 0; for (int i = n; i >= 1; i--) { if (aa[i].first + i > n + 1) dp[i] = dp[i + 1]; else dp[i] = max(dp[i + 1], aa[i].second + dp[i + a.. 2023. 4. 2. C++ 1932 정수 삼각형 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 #include #include #include #include using namespace std; int main() { int n; cin >> n; vector dp(n+1, vector(n+1, 0)); for (int i = 1; i dp[i][j]; int result = dp[1][0]; for(int i=2;i 2023. 3. 25. C++ 1149 RGB거리 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 #include #include #include #include using namespace std; int main() { int n; cin >> n; vector home(n + 2); vector dp(n+2, vector(n+2, 0)); for (int i = 1; i a; home[i].push_back(a); } } dp[1][0] = home[1][0]; dp[1][1] = home[1][1]; dp[1][2] = home[1][2]; for (int i .. 2023. 3. 23. C++ 11726 2xn 타일링 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 #include #include #include #include using namespace std; int main() { int n; cin >> n; int dp[1001] = { 0 }; dp[1] = 1 %10007; dp[2] = 2 % 10007; for (int i = 3; i 2023. 3. 22. C++ 9625 BABBA 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 #include #include #include #include using namespace std; int main() { int n; cin >> n; int dp[10001] = {}; dp[1] = 1; dp[2] = 1; for (int i = 3; i 2023. 3. 21. C++ 1032 명령 프롬프트 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 #include #include #include #include #include using namespace std; int main() { int n; cin >> n; vector s; while (n--) { string s1; cin >> s1; s.push_back(s1); } for (int i = 0; i 2023. 3. 9. 이전 1 2 3 4 ··· 9 다음
