Pagini recente » Cod sursa (job #2379658) | Cod sursa (job #169624) | Cod sursa (job #2292568) | Cod sursa (job #2104024) | Cod sursa (job #1410166)
#include <fstream>
#include <deque>
using namespace std;
#define N 100001
#define MAX 5000005
ifstream in ("deque.in");
ofstream out ("deque.out");
deque <int> v,p;
int main()
{
long long n,k,x,i,s;
in>>n>>k;
for(i=1;i<=k;i++)
{
in>>x;
while(!v.empty()&&x<v.back())
{
v.pop_back();
p.pop_back();
}
v.push_back(x);
p.push_back(i);
}
s=v.front();
for(i=k+1;i<=n;i++)
{
in>>x;
while(!v.empty()&&x<v.back())
{
v.pop_back();
p.pop_back();
}
v.push_back(x);
p.push_back(i);
if(p.front()<=i-k)
{
v.pop_front();
p.pop_front();
}
s+=v.front();
}
out<<s<<'\n';
}