Pagini recente » Cod sursa (job #1463548) | Cod sursa (job #2009638) | Cod sursa (job #1934751) | Cod sursa (job #2361238) | Cod sursa (job #1919868)
#include <cstdio>
#include <deque>
using namespace std;
int n, m;
deque<int> deq;
int main()
{
freopen("deque.in", "r", stdin);
freopen("deque.out", "w", stdout);
scanf("%d %d", &n, &m);
int x;
for(int i = 0; i < m; i++)
{
scanf("%d", &x);
deq.push_back(x);
}
long long sum = deq.front();
int nr = m;
for(int i = m; i < n; i++)
{
scanf("%d", &x);
while(nr >= m)
{
deq.pop_front();
nr--;
}
if(deq.empty() == false)
{
while(deq.front() > x)
{
deq.pop_front();
nr--;
if(nr == 0)
{
break;
}
}
}
deq.push_back(x);
nr++;
sum += deq.front();
}
printf("%lld", sum);
return 0;
}