Update 1912.cpp

encrypted-def · web-flow · commit 955d3a312a02 · 2023-12-11T15:40:23.000+09:00
diff --git a/0x10/solutions/1912.cpp b/0x10/solutions/1912.cpp
@@ -1,11 +1,12 @@
 // Authored by : Hot6Mania
-// Co-authored by : -
-// http://boj.kr/a9a359faddb34f0faf591d3421b0e6af
+// Co-authored by : BaaaaaaaaaaarkingDog
+// http://boj.kr/1fb4beecefac47d7a7f45f97f3189806
 #include <bits/stdc++.h>
 using namespace std;
 
 int n;
-int a[100010], d[100010];
+int a[100010];
+int d[100010]; // d[i] : i번째 항으로 끝나는 연속합 중 최대
 
 int main(void){
   ios::sync_with_stdio(0);
@@ -14,9 +15,8 @@ int main(void){
   cin >> n;
   for(int i = 1; i <= n; ++i){
     cin >> a[i];
-    d[i] = a[i];
   }
   for(int i = 1; i <= n; ++i)
-    d[i] = max(d[i], d[i-1] + a[i]);
+    d[i] = max(0, d[i-1]) + a[i];
   cout << *max_element(d + 1, d + n + 1);
 }
