Pagini recente » Cod sursa (job #2115219) | Cod sursa (job #2724676) | Cod sursa (job #1031213) | Cod sursa (job #1309727) | Cod sursa (job #2644907)
#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, endPos;
for (int i = 1; i <= n; i++) {
fin >> v[i];
v[i] += v[i - 1];
if (i == k || (i > k && v[i] > maxSum)) {
maxSum = v[i];
endPos = i;
}
}
int minSum = 250000, startPos;
for (int i = 0; i <= endPos - k; i++)
if (v[i] < minSum) {
minSum = v[i];
startPos = i + 1;
}
fout << startPos << " " << endPos << " " << maxSum - minSum;
return 0;
}