Cod sursa(job #824953)
Utilizator | Data | 27 noiembrie 2012 11:20:22 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<fstream>
using namespace std;
int n, i, numar, interm, prim, ultim;
int s=0, maxx=-6000000;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main(){
f>>n;
for(i=1;i<=n;i++){
f>>numar;
if(s<0){s=0;interm=i;}
s+=numar;
if(s>maxx){
prim=interm;
ultim=i;
maxx=s;
}
}
g<<maxx<<' '<<prim<<' '<<ultim<<'\n';
g.close();
return 0;
}