Cod sursa(job #279617)
Utilizator | Data | 12 martie 2009 21:37:03 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include<cstdio>
#include<cstdlib>
#include<climits>
using namespace std;
int main()
{
freopen("ssm.in","rt",stdin);
freopen("ssm.out","wt",stdout);
int n,*v,i;
scanf("%d",&n);
v=(int*)calloc(n+1,sizeof(int*));
for(i=1;i<=n;i++)scanf("%d",&v[i]);
int s_best=v[1],s_i=1,s_j=1;
int min=1;
for(i=2;i<=n;i++)
{v[i]+=v[i-1];
if(v[i]-v[min]>s_best){s_best=v[i]-v[min];s_i=min+1;s_j=i;}
if(v[i]<v[min])min=i;}
printf("%d %d %d\n",s_best,s_i,s_j);
return 0;
}