Pagini recente » Cod sursa (job #764300) | Cod sursa (job #1743771) | Cod sursa (job #3272647) | Cod sursa (job #1427592) | Cod sursa (job #858469)
Cod sursa(job #858469)
#include <fstream>
#include <list>
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
list <int> v;
int a[5000002];
int main()
{
int n,k,i;
long long s=0;
f>>n>>k;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=n;i++)
{
while(a[i]<=a[v.back()] && !v.empty()) v.pop_back();
v.push_back(i);
if(v.front()==i-k) v.pop_front();
if(i>=k) s+=a[v.front()];
}
g<<s<<'\n';
}