Pagini recente » Cod sursa (job #1772517) | Cod sursa (job #2823488) | Cod sursa (job #1021669) | Monitorul de evaluare | Cod sursa (job #2474218)
#include <iostream>
#include <fstream>
using namespace std;
int main() {
ifstream in("secv2.in");
ofstream out("secv2.out");
int length, k;
in >> length >> k;
int* arr = new int[length], max = 0;
for (int i = 0; i < length; i++) {
in >> arr[i];
max += arr[i];
}
int x = 0, y = length - 1;
for (int i = length; i >= k; i--) {
for (int j = 0; j < length - i; j++) {
int sum = 0;
for (int f = j; f < i; f++) {
sum += arr[f];
}
if (sum > max) {
max = sum;
x = j;
y = i;
}
}
}
out << x + 1 << " " << y + 1 << " " << max;
return 0;
}