Pagini recente » Cod sursa (job #1350618) | Cod sursa (job #2146931) | Cod sursa (job #739497) | Cod sursa (job #1939540) | Cod sursa (job #3308621)
#include <fstream>
using namespace std;
ifstream cin("deque.in");
ofstream cout("deque.out");
int n,k,a[5000010];
long long sum;
int dq[5000010];
int main()
{
cin>>n>>k;
for(int i=1;i<=n;i++){
cin>>a[i];
}
int Front=1,Back=0;
for(int i=1;i<=n;i++){
while(Front<=Back&&a[i]<=a[dq[Back]])Back--;
dq[++Back]=i;
if(dq[Front]==i-k)Front++;
if(i>=k)sum+=a[dq[Front]];
}
cout<<sum;
return 0;
}