Cod sursa(job #677087)
Utilizator | Vlad Frasineanu vladcf | Data | 9 februarie 2012 20:54:19 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | sim_2 | Marime | 0.44 kb |
#include<fstream>
using namespace std;
long long x,n,i,s,smax,st,dr,stm,drm;
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>n;
f>>x;
s=x;
smax=x;
st=1;
dr=1;
stm=1;
drm=1;
for (i=2;i<=n;i++)
{
f>>x;
s=s+x;
if (s>smax)
{
smax=s;
drm=i;
stm=st;
}
if (s<0)
{
s=0;
st=i+1;
dr=i+1;
}
}
g<<smax<<' '<<stm<<' '<<drm;
f.close();
g.close();
return 0;
}