Pagini recente » Cod sursa (job #1362108) | Cod sursa (job #1585681) | Cod sursa (job #690672) | Cod sursa (job #1142484) | Cod sursa (job #2973143)
#include <fstream>
#include <deque>
using namespace std;
ifstream cin ("deque.in");
ofstream cout ("deque.out");
int v[5000001],q[5000001],n,k;
int main() {
cin>>n >>k;
for(int i=1;i<=n;i++) {
cin>>v[i];
}
long long sol=0;
int st=1,dr=0;
for(int i=1;i<=n;i++) {
while(st<=dr && v[i]<=v[q[dr]])
dr--;
q[++dr]=i;
if(q[st]==i-k)
st++;
if(i>=k)
sol=sol+v[q[st]];
}
cout<<sol;
return 0;
}