Pagini recente » Cod sursa (job #1244149) | Cod sursa (job #2629519) | Cod sursa (job #1694563) | Cod sursa (job #1397143) | Cod sursa (job #2148449)
#include <fstream>
using namespace std;
ifstream in ("deque.in");
ofstream out ("deque.out");
const int N = 5000005;
int a[N], deq[N];
int main()
{
int n, k, i;
in >> n >> k;
for(i = 1; i <= n; i++)
in >> a[i];
int p = 1, u = 1, S = 0;
deq[1] = 1;
for(i = 2; i <= n; i++)
{
for(int j = u; j >= 1; j--)
if(a[deq[j]] >= a[i])
u--;
u++;
deq[u] = i;
if(deq[p] == i - k)
p++;
if(i >= k)
S += a[deq[p]];
}
out << S;
return 0;
}