Pagini recente » Cod sursa (job #1814982) | Cod sursa (job #2354735) | Cod sursa (job #2302073) | Cod sursa (job #1460908) | Cod sursa (job #1650855)
# include <fstream>
# include <deque>
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
deque< pair<int, int> > d;
int n, x, i, k;
long long sum;
int main() {
fin >> n >> k;
for (i=1; i<k; ++i) {
fin >> x;
while (!d.empty() && d.back().first > x)
d.pop_back();
d.push_back(make_pair(x, i));
}
for (i=k; i<=n; ++i) {
fin >> x;
if (i - d.front().second >= k)
d.pop_front();
while (!d.empty() && d.back().first > x)
d.pop_back();
d.push_back(make_pair(x, i));
sum += d.front().first;
}
fout << sum;
return 0;
}