Cod sursa(job #1901135)
| Utilizator | Data | 3 martie 2017 19:22:09 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <cstdio>
#include <climits>
#include <algorithm>
#define LMAX 6000000
int S[LMAX+5];
using namespace std;
int main(){
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
int n,i,x;
scanf("%d",&n);
for(i=1;i<=n;++i){
scanf("%d",&x);
S[i]=S[i-1]+x;
}
int Min=0,Max=-INT_MAX;
for(i=1;i<=n;++i){
Min=min(Min,S[i]);
if(S[i]-Min>Max) Max=S[i]-Min;
}
printf("%d \n",Max);
fclose(stdin),fclose(stdout);
return 0;
}
