Cod sursa(job #662035)
Utilizator | Data | 15 ianuarie 2012 18:36:45 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
using namespace std;
int main ()
{
long long x,s=0,max=-100000,a,b,n,i,c;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
fin>>n;
for(i=1;i<=n;i++) {
fin>>x;
if(s<0) {
s=x;
c=i;
}
else s=s+x;
if(s>max) {
max=s;
a=c;
b=i;
}
}
fout<<max<<endl<<a<<endl<<b;
fin.close();
fout.close();
return 0;
}