Cod sursa(job #1268753)
Utilizator | Data | 21 noiembrie 2014 13:45:07 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <cstdio>
using namespace std;
int n,x,smax,s,j,i,p,u;
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d%d",&n,&x);
smax=x;
s=x;
j=1;
p=1;
j=1;
for(i=1;i<n;i++)
{
scanf("%d",&x);
j++;
if(s+x<x)
{
s=x;
p=j;
}
else
s=s+x;
if(s>smax)
{
smax=s;
u=j;
}
}
printf("%d %d %d",smax,p,u);
return 0;
}