Cod sursa(job #1135930)
Utilizator | Data | 8 martie 2014 16:23:15 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream q("ssm.out");
long long m=-2000000000,n,i,j,x,s,hh,beg,fin;
int main()
{
f>>n;
j=0;
s=0;
beg=1;
hh=1;
for (i=1;i<=n;i++)
{
f>>x;
if (s<0){s=x;hh=i; j=i;}
else {s=s+x; j++;}
if (s>m){m=s; beg=hh; fin=j; }
}
q<<m<<" "<<beg<<" "<<fin;
f.close();
q.close();
}