Pagini recente » Cod sursa (job #3256743) | Cod sursa (job #1430809) | Cod sursa (job #2857974) | Cod sursa (job #1628375) | Cod sursa (job #641197)
Cod sursa(job #641197)
#include<fstream>
#include<vector>
using namespace std;
vector <int> deque;
int n,k,v[5000100];
int main() {
int i;
long long s=0;
ifstream in("deque.in");
in>>n>>k;
for(i=0;i<n;i++) {
in>>v[i];
while(deque.size()&&v[i]<v[deque.back()])
deque.pop_back();
deque.push_back(i);
if(deque.front()==i-k)
deque.erase(deque.begin(),deque.begin()+1);
if(i>k-2)
s+=v[deque.front()];
}
ofstream out("deque.out");
out<<s<<'\n';
in.close();
out.close();
return 0;
}