Cod sursa(job #560905)
Utilizator | Data | 18 martie 2011 19:03:33 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<fstream>
using namespace std;
int main()
{int i,n,st=1,en,s=0,x,best=-219999999,id;
ifstream in("ssm.in");
in>>n;
en=n;
for(i=1;i<=n;i++)
{in>>x;
if(s<0)
s=x,st=i;
else
s+=x;
if(best<s)
best=s,id=st,en=i;
}
in.close();
ofstream out("ssm.out");
out<<best<<" "<<id<<" "<<en<<'\n';
out.close();
return 0;
}