BOJ)1912 연속합(다시보기)

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

dp[i] : i 까지 연속되는 최대합

#include <algorithm>
#include <iostream>
using namespace std;
#define ARR_SIZE 100001
int arr[ARR_SIZE];
int dp[ARR_SIZE];
int main()
{
    int N;
    cin >> N;
    for(int i=1; i<=N; i++){
        cin >> arr[i];
    }
 
    for (int i = 1; i <= N; i++) {
        dp[i] = arr[i];
        if (dp[i] < dp[i - 1] + arr[i]) {
            dp[i] = dp[i - 1] + arr[i];
        }
    }
 
    int res = dp[1];
    for (int i = 1; i <= N; i++) {
        res = max(res, dp[i]);
    }
    cout << res;
}
/*
dp[0] = 10
dp[1] = 10+-4    
dp[2] = 10+-4+3
dp[3] = 10+-4+3+1
dp[4] = 10+-4+3+1+5
*/