Cod sursa(job #564267)
Utilizator | Data | 27 martie 2011 00:02:14 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
int n,nr,i,rez;
int in,s,incc,sff;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
f>>n;
rez=-1<<30;
s=0;
for (i=1;i<=n;++i)
{
f>>nr;
if (s<0)
{
s=nr;
in=i;
}
else
s+=nr;
if (s>rez)
{
rez=s;
incc=in;
sff=i;
}
}
g<<rez<<" "<<incc<<" "<<sff;
f.close();
g.close();
return 0;
}