Cod sursa(job #1049537)
Utilizator | Eftime Andrei Horatiu dr_personality | Data | 7 decembrie 2013 14:43:24 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include<stdio.h>
int beg,bestbeg,bestend,n,x,sact,smax=-100000000;
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(sact>=0)
sact=sact+x;
else
{
sact=x;
beg=i;
}
if(sact>smax)
{
smax=sact;
bestbeg=beg;
bestend=i;
}
}
printf("%d %d %d",smax,bestbeg+1,bestend+1);
return player_unu;
}