Cod sursa(job #1924887)
| Utilizator | Data | 12 martie 2017 14:21:37 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int n, x, start, end, best, sum = 0, index, i;
cin >> x;
for(i = 1; i <= n; i++) {
cin >> x;
if(sum < 0) {
sum = x;
index = i;
} else {
best += sum;
}
if(sum > best) {
best = sum;
start = index;
end = i;
}
}
cout << best << " " << start << " " << end;
return 0;
}
