2024-03-02 연속합

Author: rivkms

rivkms/DP/1912.cpp

@@ -0,0 +1,26 @@
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+int max(int a, int b) {
+    return a > b ? a : b;
+}
+int main() {
+    int m = -2147483647;
+    int n, tmp;
+
+    cin >> n;
+    vector<int> dp(n);
+    vector<int> a(n);
+    for (int i = 0; i < n; i++) {
+        cin >> a[i];
+    }
+    dp[0] = a[0];
+    for (int i = 0; i < n; i++) {
+        dp[i] = max(dp[i - 1] + a[i], a[i]);
+        if (m < dp[i]) m = dp[i];
+    }
+    cout << m;
+    return 0;
+}

rivkms/README.md

@@ -4,9 +4,9 @@
 |:----:|:---------:|:----:|:-----:|:----:|
 | 1차시 | 2024.02.12 |  DP  | [평범한 배낭](https://www.acmicpc.net/problem/12865)  | [#1](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/5) |
 | 2차시 | 2024.02.15 |  Recursion  | [하노이 탑 이동 순서](https://www.acmicpc.net/problem/11729)  | [#2](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/8) |
-| 3차시 | 2024.02.18 |  DP  | [하노이 탑 이동 순서](https://www.acmicpc.net/problem/10844)  | [#3](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/11) |
-| 4차시 | 2024.02.18 |  Backtracking  | [N-queen](https://www.acmicpc.net/problem/9663)  | [#4](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/13) |
+| 3차시 | 2024.02.18 |  DP  | [쉬운 계단 수](https://www.acmicpc.net/problem/10844)  | [#3](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/11) |
 | 4차시 | 2024.02.18 |  Backtracking  | [N-queen](https://www.acmicpc.net/problem/9663)  | [#4](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/13) |
 | 5차시 | 2024.02.24 | Backtracking | [입대](https://www.acmicpc.net/problem/31413) | [#5](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/18) |
 | 6차시 | 2024.02.27 | BFS | [토마토](https://www.acmicpc.net/problem/7576) | [#6](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/20) |
+| 7차시 | 2024.03.01 | DP | [연속합](https://www.acmicpc.net/problem/1912) | [#7](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/25) |
 ---