Cod sursa(job #1461035)
| Utilizator | Data | 14 iulie 2015 16:14:55 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.71 kb |
#include <cstdio>
using namespace std;
int v[6000001];
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
int i,n,smax,ic,im,sfm,x,sc;
scanf("%d",&n);
scanf("%d",&x);
v[1]=x;
sc=x;
smax=x;
ic=1;
im=1;
sfm=1;
for(i=2;i<=n;++i)
scanf("%d",&v[i]);
for(i=2;i<=n;++i)
{
if(sc+v[i]<v[i])
{
sc=v[i];
ic=i;
}
else
sc=sc+v[i];
if(sc>smax)
{
smax=sc;
im=ic;
sfm=i;
}
}
printf("%d",smax);
printf("%d%d",im,sfm);
return 0;
}
