Cod sursa(job #619431)
Utilizator | Data | 15 octombrie 2011 22:38:30 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include<fstream>
using namespace std;
int main(void){
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int i,i1,j1,max=-2100000,aux,pozi,pozj,suma,n;
fin>>n; fin>>suma; i1=j1=1;
for (i=2;i<=n;++i){
fin>>aux;
if(suma+aux>=aux){ suma+=aux; j1++; }
else { i1=j1=i; suma=aux; }
if (suma>max) { max=suma; pozi=i1; pozj=j1; }
}
fout<<max<<' '<<pozi<<' '<<pozj; fin.close(); fout.close();
return 0;
}