目录
P3029 [USACO11NOV] Cow Lineup S
P1886 滑动窗口 /【模板】单调队列
P1886 滑动窗口 /【模板】单调队列 - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)
这个是单调队列的一个板子题,维护区间内的最小值和最大值,在每个区间输出。
#include <iostream>
#include <map>
#include <set>
#include <algorithm>
#include<math.h>
#include<vector>
#include<queue>
#include<cstring>
#include<deque>
#define int long long
#define TEST int T; cin >> T; while (T--)
const int N = 1e6 + 10;
using namespace std;
inline void solve() {
deque<int>ans;
int n, k;
cin >> n >> k;
vector<int>a(n + 1);
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i <= n; i++)//把最小值维护在队列的头部
{
while (ans.size() && i - k+1 > ans.front()) ans.pop_front();
while (ans.size() && a[i] < a[ans.back()]) ans.pop_back();
ans.push_back(i);
if (i >= k)
{
cout << a[ans.front()] << ' ';
}
}
ans.clear();
cout << "\n";
for (int i = 1; i <= n; i++)
{
while (ans.size() && i - k +1 > ans.front()) ans.pop_front();
while (ans.size() && a[i] > a[ans.back()]) ans.pop_back();
ans.push_back(i);
if (i >= k)
{
cout << a[ans.front()] << ' ';
}
}
}
signed main() {
solve();
return 0;
}
外加一个ST表的解决代码。
#include <iostream>
#include <map>
#include <set>
#include <algorithm>
#include<math.h>
#include<vector>
#include<queue>
#include<cstring>
#define int long long
#define TEST int T; cin >> T; while (T--)
const int N = 1e6 + 10;
using namespace std;
int f1[N][30],f2[N][30];
inline void solve() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) scanf("%lld",&f1[i][0]), f2[i][0] = f1[i][0];
int h = log2(n);
for (int j = 1; j <= h; j++)
{
for (int i = 1; i + (1 << j) - 1 <= n; i++)
{
f1[i][j] = max(f1[i + (1 << j - 1)][j - 1], f1[i][j - 1]);
f2[i][j] = min(f2[i + (1 << j - 1)][j - 1], f2[i][j - 1]);
}
}
vector<int>ans_max;
for (int i = 1; i <= n-k+1; i++)
{
int l = i, r = i + k - 1;
int p = log2(r - l + 1);
ans_max.push_back(max(f1[l][p], f1[r - (1 << p) + 1][p]));
cout<<(min(f2[l][p], f2[r - (1 << p) + 1][p]))<<' ';
}
cout << "\n";
for (auto x : ans_max) cout << x << ' ';
}
signed main() {
solve();
return 0;
}
P1440 求m区间内的最小值
P1440 求m区间内的最小值 - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)
这是一个区间最值问题,我们用单调队列维护最小值,在每个区间输出此区间维护的最小值即可。
#include <iostream>
#include <map>
#include <set>
#include <algorithm>
#include<math.h>
#include<vector>
#include<queue>
#include<cstring>
#include<deque>
#include<stack>
#define int long long
#define TEST int T; cin >> T; while (T--)
const int N = 1e6 + 10;
using namespace std;
inline void solve() {
int n, k; cin >> n >> k;
vector<int>a(n + 2);
deque<int>q;
for (int i = 1; i <= n; i++) cin >> a[i+1];//符合要求输入
cout << "0\n";
for (int i = 2; i <= n; i++)
{
while (q.size() && max(1ll,i - k+1) > q.front()) q.pop_front();//这个最小值不是此区间的
while (q.size() && a[i] < a[q.back()]) q.pop_back();//维护单调性
q.push_back(i);
cout << a[q.front()] << "\n";
}
}
signed main() {
solve();
return 0;
}
也可以用线段树和ST表解决,但是单调队列是最简单的,而且速度也快。
P1638 逛画展
P1638 逛画展 - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)
用set和map和单调队列来维护答案,入队我们符合要求的边界,在边界中找最优的边界,因为也能过,所以就没有优化,代码多,但是逻辑清晰。
#include <iostream>
#include <map>
#include <set>
#include <algorithm>
#include<math.h>
#include<vector>
#include<queue>
#include<cstring>
#include<deque>
#define int long long
#define TEST int T; cin >> T; while (T--)
const int N = 1e6 + 10;
using namespace std;
inline void solve() {
int n, m;
cin >> n >> m;
vector<int>a(n + 1);
for (int i = 1; i <= n; i++) cin >> a[i];
deque<int>q;
set<int>pk;
vector<pair<int, int>>ans;
map<int, int>tt;
for (int i = 1; i <= n; i++)
{
pk.insert(a[i]);
tt[a[i]]++;
while (q.size() && a[i] == a[q.front()])
{
tt[a[q.front()]]--;
q.pop_front();
}
q.push_back(i);
if (pk.size() == m)
{
ans.push_back({ q.front(),q.back()});
tt[a[q.front()]]--;
if (tt[a[q.front()]] == 0)
{
pk.erase(a[q.front()]);
}
q.pop_front();
while (tt[a[q.front()]] > 1)
{
tt[a[q.front()]]--;
q.pop_front();
}
if(pk.size() == m)
ans.push_back({ q.front(),q.back() });
}
}
int k = 1e9,pos;
for (int i = 0; i < ans.size(); i++)
{
if (ans[i].second - ans[i].first < k)
{
k = ans[i].second - ans[i].first;
pos = i;
}
}
cout << ans[pos].first <<' '<< ans[pos].second;
}
signed main() {
solve();
return 0;
}
P3029 [USACO11NOV] Cow Lineup S
P3029 [USACO11NOV] Cow Lineup S - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)
这个题目其实和上个题逻辑一样,改一下输入输出和其他的即可。
#include <iostream>
#include <map>
#include <set>
#include <algorithm>
#include<math.h>
#include<vector>
#include<queue>
#include<cstring>
#include<deque>
#define int long long
#define TEST int T; cin >> T; while (T--)
const int N = 1e6 + 10;
using namespace std;
struct node
{
int pos, id;
}e[N];
bool cmp(node a, node b)
{
return a.pos < b.pos;
}
inline void solve() {
int n, m;
cin >> n;
set<int>pk;
for (int i = 1; i <= n; i++) cin >> e[i].pos >> e[i].id,pk.insert(e[i].id);
sort(e + 1, e + 1 + n, cmp);
deque<int>q;
m = pk.size();
pk.clear();
vector<pair<int, int>>ans;
map<int, int>tt;
for (int i = 1; i <= n; i++)
{
pk.insert(e[i].id);
tt[e[i].id]++;
while (q.size() && e[i].id == e[q.front()].id)
{
tt[e[q.front()].id]--;
q.pop_front();
}
q.push_back(i);
if (pk.size() == m)
{
ans.push_back({ q.front(),q.back() });
tt[e[q.front()].id]--;
if (tt[e[q.front()].id] == 0)
{
pk.erase(e[q.front()].id);
}
q.pop_front();
while (tt[e[q.front()].id] > 1)
{
tt[e[q.front()].id]--;
q.pop_front();
}
if (pk.size() == m)
ans.push_back({ q.front(),q.back() });
}
}
int k = 1e9;
for (int i = 0; i < ans.size(); i++)
{
if (e[ans[i].second].pos - e[ans[i].first].pos < k)
{
k = e[ans[i].second].pos - e[ans[i].first].pos;
}
}
cout << k << "\n";
}
signed main() {
solve();
return 0;
}
P2422 良好的感觉
P2422 良好的感觉 - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)
数组中的每一个元素都有一个区间中,自己便是最小的元素,我们可以把每个数的区间找出来,
单调栈和前缀和求解。
#include <iostream>
#include <map>
#include <set>
#include <algorithm>
#include<math.h>
#include<vector>
#include<queue>
#include<cstring>
#include<deque>
#include<stack>
#define int long long
#define TEST int T; cin >> T; while (T--)
const int N = 1e6 + 10;
using namespace std;
int sum[N], q[N], L[N], R[N];
inline void solve() {
int n;
cin >> n;
vector<int>a(n + 2);
for (int i = 1; i <= n; i++) cin >> a[i],sum[i]=sum[i-1]+a[i];
int ans = 0, top = 0;
a[++n] = 0;//为了把最后一个压出来
for (int i = 1; i <= n; i++)
{
while (top > 0 && a[i] < a[q[top]])
{
if (top == 1)
{
L[q[top]] = 1;
R[q[top]] = i - 1;
}
else
{
L[q[top]] = q[top - 1] + 1;
R[q[top]] = i - 1;
}
top--;
}
q[++top] = i;
}
for (int i = 1; i < n; i++)
{
ans = max(ans, (sum[R[i]] - sum[L[i] - 1]) * a[i]);
}
cout << ans << "\n";
}
signed main() {
solve();
return 0;
}
P1419 寻找段落
P1419 寻找段落 - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)
因为我们需要找到的是最优答案,有单调性,所以我们可以使用二分答案查找,用单调队列寻找是否可以找到一个合适的区间,这个区间所有元素的大于或者大于查找的答案。
#include <iostream>
#include <map>
#include <set>
#include <algorithm>
#include<math.h>
#include<vector>
#include<queue>
#include<cstring>
#include<deque>
#include<stack>
#define int long long
#define TEST int T; cin >> T; while (T--)
const int N = 1e6 + 10;
using namespace std;
int n, s, t, q[N];
double a[N],sum[N];
bool check(double x)
{
int l = 1, r = 0;
for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + a[i]-x;
for (int i = 1; i <= n; i++)
{
if (i >= s)
{
while (l <= r && sum[i - s] < sum[q[r]]) r--;
q[++r] = i - s;
}
while (l <= r && q[l] < i - t) l++;
if (l <= r && sum[i] - sum[q[l]] >= 0) return true;
}
return false;
}
inline void solve() {
cin >> n >> s >> t;
for (int i = 1; i <= n; i++) cin >> a[i];
//求解区间范围最大值
double l = -10000.0, r = 100000;
while (r - l > 1e-6)
{
double mid = (l + r) / 2;
if (check(mid)) l = mid;
else r = mid;
}
printf("%.3lf", l);
}
signed main() {
solve();
return 0;
}