Pagini recente » Cod sursa (job #702676) | Cod sursa (job #1239635) | Istoria paginii utilizator/bazagazeal | Cod sursa (job #1154989) | Cod sursa (job #2929976)
#include <iostream>
#include <fstream>
#include <limits.h>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
const int MAX_LEN = 50000;
int ps[MAX_LEN + 1], v[MAX_LEN + 1];
int main() {
int n, k;
fin >> n >> k;
for (int i = 1; i <= n; ++i) {
fin >> v[i];
ps[i] = ps[i - 1] + v[i];
}
int sum, maxSum = INT_MIN, indexL, indexR;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= i; ++j) {
sum = ps[i] - ps[j - 1];
if (sum > maxSum && i - j + 1 >= k) {
maxSum = sum;
indexL = j;
indexR = i;
}
}
}
fout << indexL << " " << indexR << " " << maxSum;
}