Cod sursa(job #1028720)
| Utilizator | Data | 14 noiembrie 2013 16:49:01 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include<stdio.h>
int n,x,bestbeg,bestend,beg,maxim,s;
int main(){
int player_unu=0;
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d",&x);
if(s<0)
{
s=x;
beg=i;
}
else
s=s+x;
if(s>maxim)
{
bestbeg=beg;
bestend=i;
maxim=s;
}
}
printf("%d %d %d",maxim,bestbeg+1,bestend+1);
return player_unu;
}