Cod sursa(job #327827)
| Utilizator | Data | 30 iunie 2009 13:39:33 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.5 kb |
#include<stdio.h>
using namespace std;
int n,v[6000001],bestsum=-2140000000;
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
int min=0,i,st,sf,indx;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&v[i]);
}
for(i=1;i<=n;i++)
{
v[i]+=v[i-1];
if(bestsum<v[i]-min)
{
bestsum=v[i]-min;
st=indx+1;
sf=i;
}
if(min>v[i]){min=v[i];indx=i;}
}
printf("%d %d %d",bestsum,st,sf);
return 0;
}
