Cod sursa(job #947919)
Utilizator | Data | 8 mai 2013 20:29:44 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<fstream>
using namespace std;
int i,n,x,s,l,mx,lmx,rmx;
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
f >> n;
l=1;lmx=1;rmx=1;
f >> s;
mx=s;
if (s<0)
{
s=0;
l=2;
}
for (i=2;i<=n;i++)
{
f >> x;
s+=x;
if (s>mx)
{
mx=s;
lmx=l;
rmx=i;
}
if (s<0)
{
s=0;
l=i+1;
}
}
g << mx << ' ' << lmx << ' ' << rmx;
return 0;
}