Cod sursa(job #306732)
Utilizator | Data | 21 aprilie 2009 20:54:35 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include <stdio.h>
#define MAX 100000
int i,v[MAX],n,s[MAX],j,max=0,pozi,pozj;
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d",&n);
for(i=0; i<n; ++i)
{ scanf("%d",&v[i]);
s[i]+=v[i];
for(j=0; j<i; ++j)
if( max<s[i]-s[j] )
{ max=s[i]-s[j];
pozi=i;
pozj=j;
}
}
scanf("%d %d %d",max,pozi,pozj);
return 0;
}