Pagini recente » Cod sursa (job #1629018) | Cod sursa (job #667710) | Cod sursa (job #2333824) | Cod sursa (job #727691) | Cod sursa (job #3303688)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
const int Max = 6e6;
vector <int> Sum;
int main()
{
freopen("secv2.in", "r", stdin);
freopen("secv2.out", "w", stdout);
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, k, X, minSum = 0, maxSum, origSt = 0, St = 1, Dr = 1;
cin >> n >> k;
Sum.resize(n + 1);
for (int i = 1; i <= n; i++)
{
cin >> X;
Sum[i] = X + Sum[i - 1];
}
maxSum = Sum[n];
for (int i = k; i <= n; i++)
{
if (minSum > Sum[i - k])
{
minSum = Sum[i - k];
origSt = i - k;
}
if (maxSum < Sum[i] - minSum)
{
maxSum = Sum[i] - minSum;
Dr = i;
St = origSt + 1;
}
}
cout << St << ' ' << Dr << ' ' << maxSum;
return 0;
}