Cod sursa(job #702635)
| Utilizator | Data | 2 martie 2012 01:36:54 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include<cstdio>
using namespace std;
int d[6000010],l,i,n,mini,maxi=-2000000,pozmin,pozmax;
int main(){
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d",&n);
d[0]=0;
for(i=1;i<=n;++i){
scanf("%d",&d[i]);
d[i]+=d[i-1];
if(d[i]<mini){
mini=d[i];
l=i;
}
if(d[i]-mini>maxi){
maxi=d[i]-mini;
pozmax=d[i];
pozmin=l+1;
}
}
printf("%d %d %d",maxi,pozmin,pozmax);
return 0;
}