Cod sursa(job #1025352)
Utilizator | Andrei Comaneci acom | Data | 9 noiembrie 2013 20:38:56 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include<cstdio>
using namespace std;
int n,x,s,smax,p=1,u=1,pf,uf;
int main()
{
int i;
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d%d",&n,&s);
smax=s;
for (i=2;i<=n;++i)
{
scanf("%d",&x);
if (s+x>x) s+=x, ++u;
else p=u=i, s=x;
if (smax<s) smax=s, pf=p, uf=u;
}
printf("%d %d %d\n",smax,pf,uf);
return 0;
}