Pagini recente » Cod sursa (job #914737) | Cod sursa (job #2255193) | Cod sursa (job #2474625) | Cod sursa (job #1098448) | Cod sursa (job #2726339)
#include <fstream>
using namespace std;
ifstream cin("deque.in");
ofstream cout("deque.out");
int deque[5000010];
int main()
{
int n, k;
cin>>n>>k;
int v[n+1];
for(int i = 1; i <= n; i++)
cin>>v[i];
int left = 1, right = 0;
long long sol = 0;
for (int i = 1; i <= n; i++)
{
while(left <= right && v[i] <= v[deque[right]])
right -= 1;
right += 1;
deque[right] = i;
if (deque[left] == i - k)
left += 1;
if (i >= k)
sol += v[deque[left]];
}
cout<<sol;
return 0;
}