1912 연속합

#include <stdio.h>
#include <algorithm>
 
using namespace std;
 
int num[100005] = { 0 };
long long dp[100005] = { 0 };
 
int main() {
    int n;
    scanf("%d", &n);
 
    for (int i= 1; i <= n; i++) {
        scanf("%d", &num[i]);
    }
        
    dp[1] = num[1];
    for (int i = 2; i <= n; i++) {
        if (dp[i - 1] + num[i] > num[i])
            dp[i] = dp[i - 1] + num[i];
        else
            dp[i] = num[i];
    }
 
    long long maxRst = -10000000;
    for (int i = 1; i <= n; i++) {
        if (maxRst < dp[i])
            maxRst = dp[i];
    }
    printf("%lld", maxRst);
}