Cod sursa(job #1049539)
Utilizator | Data | 7 decembrie 2013 14:45:05 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include<fstream>
using namespace std;
int main()
{
ifstream in ("ssm.in");
ofstream out ("ssm.out");
long long n,s,elem,i,j,mx,st;
st=s=mx=0;
in>>n;
for (int c=0;c<n;++c)
{
in>>elem;
if (s>=0) // nu scade
s+=elem;
else
{
s=elem;
st=c;
}
if (mx<s)
{
mx=s;
j=c+1;
i=st+1;
}
}
out<<mx<<' '<<i<<' '<<j<<'\n';
in.close();
out.close();
return 0;
}