AcWing 154. 滑动窗口
原题链接
简单
作者:
m_math
,
2024-04-10 16:41:36
,
所有人可见
,
阅读 7
set写法
#include <iostream>
#include <set>
using namespace std;
const int N = 1000010;
int n,k;
int a[N];
multiset<int> s;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
cin >> n >> k;
for(int i = 1;i <= n;i++)
cin >> a[i];
for(int i = 1;i <= k;i++)
s.insert(a[i]);
for(int i = k;i <= n;i++)
{
cout << *s.begin() << ' ';
s.insert(a[i + 1]);
s.erase(s.find(a[i - k + 1]));
}
cout << endl;
s.clear();
for(int i = 1;i <= k;i++)
s.insert(a[i]);
for(int i = k;i <= n;i++)
{
cout << *s.rbegin() << ' ';
s.insert(a[i + 1]);
s.erase(s.find(a[i - k + 1]));
}
return 0;
}
单调队列写法
#include <iostream>
#include <deque>
using namespace std;
const int N = 1000010;
int n,k;
int a[N];
deque<int> q;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
cin >> n >> k;
for(int i = 1;i <= n;i++)
cin >> a[i];
for(int i = 1;i <= n;i++)
{
if(q.size() && q.front() <= i - k) q.pop_front();
while(q.size() && a[i] <= a[q.back()]) q.pop_back();
q.push_back(i);
if(q.back() >= k) cout << a[q.front()] << ' ';
}
cout << endl,q.clear();
for(int i = 1;i <= n;i++)
{
if(q.size() && q.front() <= i - k) q.pop_front();
while(q.size() && a[i] >= a[q.back()]) q.pop_back();
q.push_back(i);
if(q.back() >= k) cout << a[q.front()] << ' ';
}
return 0;
}