Cod sursa(job #35984)
Utilizator | Paul Diac diac_paul | Data | 22 martie 2007 20:03:25 |
---|---|---|---|
Problema | Secventa | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.51 kb |
#include <iostream.h>
long const max=60005;
long v[max],s[max],d[max],n,k,su;
int main()
{
long i,j,smax,imax,jmax;
su=0;
cin>>n;
for (i=1;i<=n;i++)
{
cin>>v[i];
s[i]=0;
su+=v[i];
}
s[1]=v[1];
for (i=2;i<=n;i++) s[i]=s[i-1]+v[i];
d[n]=v[n];
for (i=n-1;i>0;i--) d[i]=d[i+1]+v[i];
smax=-1000000000;
for (i=1;i<=n;i++)
{
for (j=i;j<=n;j++) if (smax<su-s[i-1]-d[j+1])
{
smax=su-s[i-1]-d[j+1];
imax=i;
jmax=j;
}
}
cout<<imax<<" "<<jmax<<" "<<smax<<"\n";
return 0;
}