Cod sursa(job #414835)
Utilizator | Data | 10 martie 2010 16:38:51 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<fstream>
using namespace std;
int main()
{int i,n,start=1,j,a,beg;
long long max,s;
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>n;
f>>a;s=a;max=a;
for(i=2;i<=n;++i)
{f>>a;
if(a>s+a)
{s=a;start=i;}
else
s+=a;
if(s>max)
{max=s;
j=i;
beg=start;}
}
g<<max<<" "<<start<<" "<<j;
f.close();
g.close();
return 0;
}