Cod sursa(job #824975)
Utilizator | Data | 27 noiembrie 2012 11:29:48 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int c,suma,v[6000001],u,p,x,n,i;
int main(){
f>>n;
c=-6000001;
for(i=1;i<=n;i++) f>>v[i];
p=u=1;
for(i=1;i<=n;i++){
if(suma<0){
suma=v[i];
x=i;
}
else suma+=v[i];
if(c<suma){
c=suma;
p=x;
u=i;
}
}
g<<c<<' '<<p<<' '<<u<<'\n';
return 0;
}