백준/백준-C++
1912번: 연속합
Beabletoet
2017. 6. 12. 15:21
#include<cstdio>
#include<algorithm>
#define max(a,b) (a>b)?a:b
int num[100000];
int main()
{
int n;
scanf("%d", &n);
for (int i = 0; i < n; ++i)
scanf("%d", &num[i]);
for (int i = 1; i < n; ++i)
num[i] = max(num[i], num[i] + num[i - 1]);
printf("%d", *(std::max_element(&num[0], &num[n])));
}