Cod sursa(job #1697278)
| Utilizator | Data | 1 mai 2016 13:55:52 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <cstdio>
using namespace std;
int f[6000005],g[6000005],k,i,m,s,smax,j,x;
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d",&x);
for(k=1;k<=x;k++)
scanf("%d",&f[k]);
for(g[1]=f[1],k=2,smax=-(1e9);k<=x;k++)
{
g[k]=max(g[k-1]+f[k],f[k]);
if(g[k]>smax)
{
smax=g[k];
i=k;
}
}
printf("%d ",smax);
for(k=i;k>=1&&smax;k--)
smax-=f[k];
k++;
printf("%d %d\n",k,i);
return 0;
}
