Cod sursa(job #2334925)
Utilizator | Lipianu Ana AnnaLipianu | Data | 3 februarie 2019 13:01:51 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include<cstdio>
using namespace std;
#define INF 9223372036854775808
int main(){
freopen("ssm.in", "r",stdin);
freopen("ssm.out", "w",stdout);
int n, i, inc, fin, b;
long long s, a, max, smax;
scanf("%d", &n);
s=0;
smax=-INF;
inc=1;
b=1;
for(i=1; i<=n; i++){
scanf("%lld", &a);
if(s<0){
s=0;
b=i;
}
s+=a;
if(s>smax){
smax=s;
inc=b;
fin=i;
}
}
printf("%lld %d %d", smax, inc,fin);
return 0;
}