Cod sursa(job #2207441)
| Utilizator | Data | 25 mai 2018 18:29:15 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int main() {
int n, p = 1, best = - (1<<30), sum = 0, min = 0;
int number, start, finish;
in>>n;
for(int i = 1; i <= n; i++) {
in>>number;
sum += number;
if(sum - min > best) {
best = sum - min;
start = i;
finish = i;
p = i;
}
if(sum < min)
min = sum;
}
out<<best<<" "<<start - 1<<" "<<finish;
return 0;
}