Pagini recente » Cod sursa (job #2119897) | Cod sursa (job #456886) | Cod sursa (job #873675) | Cod sursa (job #1766619) | Cod sursa (job #1049588)
#include<fstream>
#include<deque>
using namespace std;
int main()
{
ifstream f("deque.in");
ofstream g("deque.out");
deque <int> deq;
int i,n,k,v[5000001];
long long s;
f>>n;
f>>k;
for(i=1;i<=n;i++){
f>>v[i];
while(deq.size() && v[i]<v[deq.back()])
deq.pop_back();
deq.push_back(i);
if(deq.front()==i-k)
deq.pop_front();
if(i>=k)
s+=v[deq.front()];
}
g<<s;
return 0;
}