Pagini recente » Cod sursa (job #3140226) | Cod sursa (job #304128) | Cod sursa (job #133710) | Cod sursa (job #155638) | Cod sursa (job #2887935)
#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
int main() {
ifstream fileIn("deque.in");
ofstream fileOut("deque.out");
int n, k, i, a;
long long suma=0;
vector <int> vectr;
vector <int> dQ;
fileIn >> n >> k;
for(i=0; i < n; i++) {
fileIn >> a;
vectr.push_back(a);
while(!dQ.empty() && a <= vectr[dQ.back()]) {
dQ.pop_back();
}
dQ.push_back(i);
if (!dQ.empty() && dQ.front() == i-k) {
dQ.erase(dQ.begin());
}
if (i >= k-1) {
suma += vectr[dQ.front()];
cout << vectr[dQ.front()]<<endl;;
}
}
fileOut << suma;
return 0;
}