Cod sursa(job #528200)
| Utilizator | Data | 2 februarie 2011 13:17:35 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 85 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include<cstdio>
using namespace std;
int N,i,min,bestsol=-999999999,idx,beg,end,V[7000010];
void read(),solve();
int main()
{
read();
solve();
return 0;
}
void read()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d",&N);
}
void solve()
{
for(i=1;i<=N;i++)
{
scanf("%d",&V[i]);V[i]+=V[i-1];
if(bestsol<V[i]-min){bestsol=V[i]-min;beg=idx+1;end=i;}
if(min>V[i])min=V[i],idx=i;
}
printf("%d %d %d",bestsol,beg,end);
}
