Merge pull request #2 from AlgoLeadMe/1-kangrae-jo

1-kangrae-jo

kangrae-jo/DP/1-kangrae-jo.cpp

@@ -0,0 +1,30 @@
+#include <algorithm>
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+int solution(vector<int>& s, int n) {
+    // maxendpoint
+    vector<int> dp(n + 1, 0);
+    dp[1] = s[1];
+
+    int maxSum = dp[1];
+    for (int i = 2; i <= n; i++) {
+        dp[i] = max(dp[i - 1] + s[i], s[i]);
+        if (dp[i] > maxSum) maxSum = dp[i];
+    }
+
+    return maxSum;
+}
+
+int main() {
+    int n;
+    cin >> n;
+    vector<int> s(n+1,0);
+    for (int i = 1; i <= n; i++) cin >> s[i];
+
+    cout << solution(s, n);
+
+    return 0;
+}

kangrae-jo/README.md

@@ -2,5 +2,5 @@
 
 | 차시 |    날짜    | 문제유형 | 링크 | 풀이 |
 |:----:|:---------:|:----:|:-----:|:----:|
-| 1차시 | 2024.10.01 |  구현  | [추억 점수](https://school.programmers.co.kr/learn/courses/30/lessons/176963)|https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/35|
+| 1차시 | 2024.09.28 |  DP  | [연속합](https://www.acmicpc.net/problem/1912)|[#2]https://github.com/AlgoLeadMe/AlgoLeadMe-12/pull/2|
 ---