Cod sursa(job #662031)
Utilizator | Darius Bucsa dariusbucsa | Data | 15 ianuarie 2012 18:35:14 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<fstream>
using namespace std;
int main ()
{
long long s=0,max=-10,poz_i,poz_f,n,i,c;
int v[60000];
ifstream fin("ssm.in");
ofstream fout("ssm.out");
fin>>n;
for(i=1;i<=n;i++) {
fin>>v[i];
if(s<0) {
s=v[i];
c=i;
}
else s=s+v[i];
if(s>max) {
max=s;
poz_i=c;
poz_f=i;
}
}
fout<<max<<endl<<poz_i<<endl<<poz_f;
fin.close();
fout.close();
return 0;
}