Cod sursa(job #1247739)
Utilizator | Matei Staicu smatei16 | Data | 23 octombrie 2014 16:07:17 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 15 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <cstdio>
using namespace std;
int n,i,a[1000],smax,sc,pozi,pozu,pozc;
int main()
{freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
smax=a[1];
sc=a[1];pozi=1;pozu=1;pozc=1;
for(i=2;i<=n;i++){
if(sc>0)sc+=a[i];
else {sc=a[i];
pozc=i;}
if(sc>smax){
pozi=pozc;
pozu=i;
smax=sc;
}
}
printf("%d %d %d",smax,pozi,pozu);
return 0;
}