백준 소스코드 [C++] 1912 연속합

www.acmicpc.net/problem/1912

1912번: 연속합

백준 소스코드 [C++] 1912 연속합

#include <iostream>
#include <algorithm>
#include <queue>
#include <string.h>
#include <limits.h>
#include <vector>
typedef long long ll;
using namespace std;
int n, arr[100001];
void dp() {
	int res = -987654321, sum=0;
	for (int i = 1;i <= n;i++) {
		if (sum < 0) sum = 0;
		sum = sum + arr[i];
		res = max(res, sum);
	}
	cout << res;
}
int main() {
	cin >> n;
	for (int i = 1;i <= n;i++) cin >> arr[i];
	dp();
	return 0;
}