Cod sursa(job #1520916)
Utilizator | Data | 9 noiembrie 2015 18:22:00 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.64 kb |
#include<cstdio>
#include<algorithm>
using namespace std;
int n,v[6000000],i,d[50000000],pos[6000000],maxim=-6000000,s,f;
int main()
{
d[0]=0;
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&v[i]);
d[i]=max(v[i],v[i]+d[i-1]);
if(d[i]==v[i]) pos[i]=i;
else {
pos[i]=pos[i-1];
while(v[pos[i]-1]==0) pos[i]--;
}
if(max(maxim,d[i])==d[i])
{
maxim=d[i];
f=i;
s=pos[i];
}
}
printf("%d %d %d\n",maxim,s,f);
}