Cod sursa(job #279171)
Utilizator | Mester Flavius flavius_mester | Data | 12 martie 2009 18:21:25 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 35 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include<cstdio>
#include<cstdlib>
using namespace std;
int *v;
int main()
{
int n,i,j;
int Smax=0,s=0;
int xm,ym;
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d",&n);
v=(int *)realloc(v,n*sizeof(int *));
for(i=1;i<=n;i++){scanf("%d",&v[i]);
s+=v[i];if(s>Smax){Smax=s;xm=1;ym=i;}
}
for(i=2;i<n;i++)
{s=0;
for(j=i;j<=n;j++){s+=v[j];
if(Smax<s){Smax=s;xm=i;ym=j;}
}
}
printf("%ld %d %d\n",Smax,xm,ym);
return 0;}