Cod sursa(job #3139092)
Utilizator | Data | 24 iunie 2023 21:04:48 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
using namespace std;
const int MAX_LENGTH = 30000;
int main() {
int numLen;
cin >> numLen;
int num[MAX_LENGTH + 1];
for (int i = 1; i <= numLen; ++i) {
cin >> num[i];
}
int maxSum = 0, start = 0, end = 0;
for (int i = 1; i < numLen; ++i) {
int sum = 0;
for (int j = i; j <= numLen; ++j) {
sum += num[j];
if (sum > maxSum) {
maxSum = sum;
start = i;
end = j;
}
}
}
cout << maxSum << ' ' << start << ' ' << end;
return 0;
}