Cod sursa(job #1193094)
Utilizator | Data | 30 mai 2014 22:58:55 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <cstdio>
using namespace std;
int n, smax=0, maxst=1, maxfin=0;
int main()
{
int i, s=0, st, x;
freopen("ssm.in", "r", stdin);
freopen("ssm.out", "w", stdout);
scanf("%d", &n);
for(i=1; i<=n; i++){
scanf("%d", &x);
s = s+x;
if(s<0){
s = 0;
st = i+1;
}
if(s>smax or(s==smax and maxfin-maxst>i-st)){
smax = s;
maxst = st;
maxfin = i;
}
}
printf("%d %d %d\n", smax, maxst, maxfin);
return 0;
}