[1912] 연속합

https://www.acmicpc.net/problem/1912

1912번: 연속합

 

---

 

💡 내 코드(C++)

/*[1912] 연속합*/
/*https://www.acmicpc.net/problem/1912 */

#include <iostream>
#include <algorithm>
using namespace std;

int main(void)
{
    int n, max;
    int arr[100001], dp[100001];
    cin >> n;
    
    for (int i = 0; i < n; i++) {
    	cin >> arr[i];
    }   

    dp[0] = arr[0];
    
    for (int i = 1; i < n; i++) {
        if (arr[i] > dp[i - 1] + arr[i])
            dp[i] = arr[i];
        else
            dp[i] = dp[i - 1] + arr[i];
    }
    
    max = dp[0];
    for (int i = 0; i < n; i++) {
    	if (dp[i] > max)
            max = dp[i];
    }
        
    cout << max << endl;
}