Cod sursa(job #1117755)
Utilizator | Data | 23 februarie 2014 19:46:51 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include<cstdio>
using namespace std;
int n,x,P,U,i;
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d%d",&n,&x);
int s=x,smax=x,p=1,u=1;
for (i=2;i<=n;++i)
{
scanf("%d",&x);
if (s+x>=x)
{
s=s+x;
++u;
}
else
{
s=x;
p=u=i;
}
if (s>smax)
{
smax=s;
P=p;
U=u;
}
}
printf("%d %d %d\n",smax,P,U);
return 0;
}