Cod sursa(job #639979)
Utilizator | Data | 24 noiembrie 2011 14:40:38 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <cstdio>
#define INF -32000
int main()
{
int v[100],sum,Best,n,inc,sf;
sum=0; Best=INF;
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d",&n);
for(int i=1;i<=n;++i)
{
scanf("%d",&v[i]);
sum+=v[i];
if(sum<0) { sum=0; inc = i; }
else if(sum>Best) { Best=sum; sf=i; }
}
printf("%d ",Best);
printf("%d %d",inc+1,sf);
}