Pagini recente » Cod sursa (job #1994772) | Cod sursa (job #2785489) | Cod sursa (job #834595) | Cod sursa (job #1782685) | Cod sursa (job #2022566)
#include <bits/stdc++.h>
using namespace std;
const int maxn = 50000 +10;
int v[maxn] = {};
array<int, 2> d[maxn] = {};
int main(){
ifstream f("secv2.in");
ofstream g("secv2.out");
int n, k;
f >> n >> k;
for(int i = 1; i <= n; ++i) f >> v[i];
for(int i = 1; i <= n; ++i){
d[i] = max(d[i-1], array<int, 2> { 0, i });
d[i][0] += v[i]; }
--k;
int sum = 0;
for(int i = 1; i <= k; ++i) sum += v[i];
array<int, 3> rez = {sum, 1, k};
for(int i = k; i <= n; ++i, sum += v[i], sum -= v[i-k])
rez = max(rez, array<int, 3> { sum + d[i-k][0], d[i-k][1], i});
g << rez[1] << ' '<< rez[2] << ' '<< rez[0] << endl;
return 0; }