Pagini recente » Cod sursa (job #2750190) | Cod sursa (job #1245024) | Cod sursa (job #940569) | Cod sursa (job #543223) | Cod sursa (job #1362804)
#include <fstream>
#include <deque>
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
deque<int> D;
int i,j,n,k,v[5000001];
long long int rasp;
int main()
{
f>>n>>k;
for(i=1;i<=n;++i)
f>>v[i];
for(i=1;i<=n;i++)
{
if(!D.empty()&&D.front()<=i-k)
D.pop_front();
while(!D.empty()&&v[i]<v[D.back()])
{
D.pop_back();
continue;
D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()]; D.push_back(i);
if(i>=k)
rasp+=v[D.front()];
}
D.push_back(i);
if(i>=k)
rasp+=v[D.front()];
}
g<<rasp;
return 0;
}