Cod sursa(job #1939528)
Utilizator | Data | 25 martie 2017 19:49:24 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
int n, x, i, smax, s, st, dr, idx;
fin>>n;
idx=st=dr=1;
s=smax=0;
for(i=1; i<=n; i++)
{
fin>>x;
if(s<0)
{
s=x;
idx=i;
}
else s+=x;
if(s>smax)
{
smax=s;
st=idx;
dr=i;
}
}
fout<<smax<<' '<<st<<' '<<dr<<'\n';
return 0;
}