Cod sursa(job #2657851)
| Utilizator | Data | 12 octombrie 2020 14:14:36 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include<fstream>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int main(){
long long sum = 0, best, n, x, ind, sf = 1, in = 1;
cin >> n;
cin >> best;
for(int i = 2; i <= n; i++) {
cin >> x;
if(sum < 0) {
sum = x, ind = i;
} else {
sum += x;
}
if(sum > best) {
best = sum;
in = ind;
sf = i;
}
}
cout << best << " " << in << " " << sf;
}
