原题链接:https://www.luogu.com.cn/problem/P1115
算法标签:动态规划
代码:
#include <iostream>
#include <cmath>
using namespace std;
#define INT_MIN 0xc0c0c0c0
const int maxN = 2e5+9;
int main(){
int n;
int arr[maxN];
cin >> n;
for( int i=1; i<=n; i++ ){
cin >> arr[i];
}
int tmp = 0;
int ans = INT_MIN;
for( int i=1; i<=n; i++ ){
tmp += arr[i];
ans = max(ans, tmp);
if( tmp < 0 ){
tmp = 0;
}
}
cout << ans;
return 0;
}