Pagini recente » Cod sursa (job #433118) | Cod sursa (job #1226998) | Cod sursa (job #2075287) | Cod sursa (job #560403) | Cod sursa (job #2910723)
#include <iostream>
#include <fstream>
using namespace std;
int n, k, x, y, maxSum, s[50001];
int main() {
ifstream fin("secv2.in");
ofstream fout("secv2.out");
fin >> n >> k;
for (int i = 1; i <= n; ++i) {
fin >> x;
s[i] = s[i - 1] + x;
}
maxSum = -25001;
for (int t = k ; t <= n; ++t) {
for (int i = 1; i <= n - t + 1; ++i) {
if (maxSum < s[i + t - 1] - s[i - 1]) {
maxSum = s[i + t - 1] - s[i - 1];
x = i;
y = i + t - 1;
}
}
}
fout << x << ' ' << y << ' ' << maxSum;
return 0;
}