Cod sursa(job #279096)
Utilizator | Mester Flavius flavius_mester | Data | 12 martie 2009 17:51:55 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 35 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<cstdio>
using namespace std;
int v[1000001];
int main()
{
int n,i,j;
int Smax=0,s=0;
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&v[i]);
int xm,ym;
for(i=1;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;}