Pagini recente » Cod sursa (job #2066890) | Cod sursa (job #2037932) | Cod sursa (job #1187602) | Cod sursa (job #1187451) | Cod sursa (job #2044274)
#include <fstream>
#include <deque>
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
deque <int> d;
int a[5000000];
int n,k;
long long SUM;
void Read()
{
fin>>n>>k;
for(int i=1; i<=n; ++i)
fin>>a[i];
fin.close();
}
void Do()
{
for(int i=1; i<=n; ++i)
{
while(!d.empty() && a[i]<=a[d.back()])
d.pop_back();
d.push_back(i);
if(i-k==d.front()) d.pop_front();
if(i>=k) SUM+=a[d.front()];
}
//fout<<a[i]<<' ';
}
void Print()
{
fout<<SUM<<'\n';
fout.close();
}
int main()
{
Read();
Do();
Print();
return 0;
}