Cod sursa(job #824994)
Utilizator | Data | 27 noiembrie 2012 11:35:50 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<fstream.h>
ifstream f("ssm.in");
ofstream g("ssm.out");
int suma, n, k, v[6500005], sub, x, i;
int smax=-1000000;
int main(){
f>>n;
for(i=1;i<=n;++i)f>>v[i];
for(i=1;i<=n;++i){
if(suma<0){
suma=v[i];
k=i;}
else suma=suma+v[i];
if(smax<suma){
smax=suma;
sub=k;
x=i;
}
}
g<<smax<<' '<<sub<<' '<<x;
g.close();
return 0;
}