Cod sursa(job #1333869)
| Utilizator | Data | 3 februarie 2015 17:44:54 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include<cstdio>
using namespace std;
int n,smax,ci,cs,s,x;
int main(){
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d",&n);
smax=-2000000001;
ci=1;
cs=1;
s=0;
int cci=1,ccs=1;
for(int i=1;i<=n;i++){
scanf("%d",&x);
s+=x;
if(s>smax){
smax=s;
cs=i;
cci=ci;
ccs=cs;
}
if(s<0){
s=0;
ci=i+1;
cs=i+1;
}
}
printf("%d %d %d",smax,cci,ccs);
return 0;
}
