[백준 1912: 연속합] - C++

www.acmicpc.net/problem/1912

1912번: 연속합

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
	int n;
	cin >> n;
	int arr[100001];
	int dp[100001];
	int input;
	for (int i = 0; i < n; i++)
	{
		cin >> input;
		arr[i] = input;
		dp[i] = input;
	}

	int result = dp[0];
	for (int i = 1; i < n; i++)
	{
		dp[i] = max(dp[i], dp[i - 1] + arr[i]);

		if (result < dp[i])
			result = dp[i];
	}

	cout << result << endl;

	return 0;
}