Cod sursa(job #1652024)
| Utilizator | Data | 14 martie 2016 15:39:06 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include<fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n, v[6000001];
void generare() {
int sum = 0, start, end, maxim = -1;;
for (int i = 1; i <= n; i++) {
sum += v[i];
if (sum < 0) {
sum = 0;
start = i + 1;
}
else if(sum>maxim){
maxim = sum;
end = i;
}
}
fout << sum<< " " << start << " " << end;
}
int main() {
fin >> n;
for (int i = 1; i <= n; i++)
fin >> v[i];
generare();
return 0;
}