Pagini recente » Cod sursa (job #246801) | Cod sursa (job #316584) | Cod sursa (job #1902388) | Cod sursa (job #1795606) | Cod sursa (job #2888471)
#include <fstream>
#include <iostream>
using namespace std;
class Asd
{
public:
long long first;
long long second;
};
Asd a[5000002];
long coada = 0, cap = 0;
void pushFront(const long long &x, const long long &c)
{
cap++;
a[cap].first = x;
a[cap].second = c;
}
void popFront()
{
cap--;
}
void popBack()
{
coada++;
}
Asd back() { return a[coada + 1]; }
bool gol() { return (cap == coada) ? 1 : 0; }
Asd front() { return a[cap]; }
int k = 0, n = 0, x, mm = 0;
int main()
{
ofstream cout("deque.out");
ifstream cin("deque.in");
// ifstream cin("dec.py");
cin >> n >> k;
for (size_t i = 0; i < n; i++)
{
cin >> x;
if (i >= k)
{
mm += back().first;
}
while (!gol() and front().first > x)
{
popFront();
}
pushFront(x, i);
if (!gol() and back().second == i - k)
{
popBack();
}
}
cout << mm + back().first;
return 0;
}