Cod sursa(job #931434)
| Utilizator | Data | 28 martie 2013 11:18:09 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 85 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <cstdio>
using namespace std;
int v[6000005];
int main()
{
int i,n,min,max,st,dr,x;
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d",&n);
scanf("%d",&x);
v[1]=x;
max=v[1];
dr=1;
for(i=2;i<=n;i++)
{
scanf("%d",&x);
v[i]=v[i-1]+x;
if(v[i]>max)
{
max=v[i];
dr=i;
}
}
min=v[dr];
st=dr;
for(i=dr-1;i>=1;i--)
if(v[i]<min)
{
min=v[i];
st=i+1;
}
printf("%d %d %d",max-min,st,dr);
return 0;
}
