Pagini recente » Cod sursa (job #49082) | Cod sursa (job #784797) | Cod sursa (job #849224) | Cod sursa (job #2709513) | Cod sursa (job #2815799)
#include <fstream>
#include <vector>
#include <climits>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int partial_sum[50001], max_sum = INT_MIN;
int main() {
int n, k, current_element;
fin >> n >> k;
for (int i = 1; i <= n; ++i) {
fin >> current_element;
partial_sum[i] = partial_sum[i - 1] + current_element;
}
int start_pos, end_pos;
for (int i = 1; i <= n; ++i) {
for (int j = i + k - 1; j <= n; ++j) {
if (partial_sum[j] - partial_sum[i - 1] > max_sum) {
max_sum = partial_sum[j] - partial_sum[i - 1];
start_pos = i;
end_pos = j;
}
}
}
fout << start_pos << ' ' << end_pos << ' ' << max_sum;
return 0;
}