Pagini recente » Cod sursa (job #101948) | Cod sursa (job #1941948) | Cod sursa (job #2107518) | Cod sursa (job #1336193) | Cod sursa (job #2644896)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin ("secv2.in");
ofstream fout ("secv2.out");
int main() {
fin.tie(0);
ios::sync_with_stdio(0);
int n, k;
fin >> n >> k;
vector<int> v(n + 1, 0);
int maxSum;
for (int i = 1; i <= n; i++) {
fin >> v[i];
v[i] += v[i - 1];
if (i == k)
maxSum = v[i];
}
int startPos = 1, endPos = k;
for (int i = k; i <= n; i++)
for (int j = 0; j <= i - k; j++)
if (v[i] - v[j] > maxSum) {
maxSum = v[i] - v[j];
startPos = j + 1;
endPos = i;
}
fout << startPos << " " << endPos << " " << maxSum;
return 0;
}