Mai intai trebuie sa te autentifici.
Cod sursa(job #2119041)
| Utilizator | Data | 31 ianuarie 2018 16:04:14 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <bits/stdc++.h>
using namespace std;
int n, x;
int main(){
freopen("ssm.in", "r", stdin);
freopen("ssm.out", "w", stdout);
scanf("%d", &n);
long long Sol = -1000000000000000000, Sum = 0, Min = 1000000000000000000;
int st = 0, dr = n, sm = 0;
for(int i = 1; i <= n ; ++i){
scanf("%d", &x);
Sum += x;
if(Sum - Min > Sol) Sol = Sum - Min, st = sm + 1, dr = i;
if(Min > Sum) Min = Sum, sm = i;
}
printf("%lld ", Sol);
printf("%d %d", st, dr);
return 0;
}
