Cod sursa(job #1500322)
| Utilizator | Data | 11 octombrie 2015 19:02:04 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 85 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main() {
int n, sum, a, maxx, l, r;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
fin >> n;
fin >> sum;
maxx = sum;
l = r = 1;
for(int i = 1; i < n; ++i) {
fin >> a;
if(sum < 0){
sum = a;
l = i+1;
}
else
sum += a;
if(sum > maxx){
maxx = sum;
r = i+1;
}
}
fout << maxx << " " << l << " " << r;
return 0;
}
