Pagini recente » Cod sursa (job #52573) | Cod sursa (job #2329792) | Cod sursa (job #1334173) | Cod sursa (job #34370) | Cod sursa (job #2864245)
#include<bits/stdc++.h>
using namespace std;
ifstream f("bmatrix.in");
ofstream g("bmatrix.out");
long long v[500002];
deque <int> d;
int main()
{int n,k;
long long sol=0;
f>>n>>k;
for (int i=1;i<=n;i++) f>>v[i];
for (int 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();
d.push_back(i);
if (i>=k) sol+=v[d.front()];
}
g<<sol;
}