Cod sursa(job #327826)
Utilizator | George Popoiu popoiu.george | Data | 30 iunie 2009 13:38:09 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include<stdio.h>
using namespace std;
int n,v[6000001],bestsum=-2140000000,s[6000001];
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]);
s[i]=s[i-1]+v[i];
}
for(i=1;i<=n;i++)
{
if(bestsum<s[i]-min)
{
bestsum=s[i]-min;
st=indx+1;
sf=i;
}
if(min>s[i]){min=s[i];indx=i;}
}
printf("%d %d %d",bestsum,st,sf);
return 0;
}