浅谈队列:https://www.cnblogs.com/AKMer/p/10314965.html 题目传送门:https://lydsy.com/JudgeOnline/problem.php?id=2276 假设一段区间满足不降的要求,那么充要条件是\(l_{max}<=r_{min}\) 所以我们用单调队列维护\(l\)的最大值然后更新答案即可. 时间复杂度:\(O(n)\) 时间复杂度:\(O(n)\) 代码如下: #include <cstdio> #include <…

2276: [Poi2011]Temperature Time Limit: 20 Sec  Memory Limit: 32 MBSubmit: 293  Solved: 117[Submit][Status] Description The Byteotian Institute of Meteorology (BIM) measures the air temperature daily. The measurement is done automatically, and its res…

题目链接 BZOJ2276 题解 一开始看错题,以为求的是可以不连续的,想出一个奇怪的线段树,发现空间根本开不下?? 题目要我们求连续的最长可能不下降区间 对于区间\([l,r]\)如果合法,当且仅当对于\(\forall i \in [l,r],\forall j < i\)满足\(l[j] <= r[i]\) 所以我们只需维护一个\(l[i]\)递减的单调队列即可 为什么是对的呢? 对于位置\(i\),显然至少取\(l[i]\),最多取\(r[i]\),如果存在\(l[j] > r[…

这题有两种写法,而且是完全(几乎?)不一样的写法...并不是换了个方法来维护而已 单调队列O(N):用一个队列维护a[]的单调递减,对于每个i满足a[队头]<=b[i],然后就可以算出以每一位为结尾的最大答案了 #include<stdio.h> #include<cstring> #include<iostream> #include<cstdlib> using namespace std; ,inf=1e9; int n,fir,ans; int…

Code: #include<bits/stdc++.h> #define maxn 3000000 using namespace std; void setIO(string s) { string in=s+".in"; freopen(in.c_str(),"r",stdin); } deque<int>q; int l[maxn],r[maxn]; int main() { // setIO("input");…

+++++++++++++++++++++++++++++++++++++++++++ +本文作者:luyouqi233. + +欢迎访问我的博客:http://www.cnblogs.com/luyouqi233/+ +++++++++++++++++++++++++++++++++++++++++++ https://www.luogu.org/problemnew/show/3527 http://www.lydsy.com/JudgeOnline/problem.php?id=2527…

浅谈离线分治算法:https://www.cnblogs.com/AKMer/p/10415556.html 题目传送门:https://lydsy.com/JudgeOnline/problem.php?id=2527 我们增加一次陨石雨,最后一次陨石雨的会给每个收集站都增加\(inf\)个陨石.然后我们把所有的国家一起整体二分答案,如果答案等于最后一次陨石雨那么就输出\(NIE\). 每次整体二分,我们先将\([l,mid]\)的陨石雨下完.在树状数组上区间修改单点询问.然后我们把每个国家都…

浅谈线段树合并:https://www.cnblogs.com/AKMer/p/10251001.html 题目传送门:https://lydsy.com/JudgeOnline/problem.php?id=2212 递归去做,统计每个子树内最少会产生多少逆序对,在合并线段树的时候统计就好了. 代码如下: #include <cstdio> #include <algorithm> using namespace std; typedef long long ll; const…

Description The Byteotian Institute of Meteorology (BIM) measures the air temperature daily. The measurement is done automatically, and its result immediately printed. Unfortunately, the ink in the printer has long dried out... The employees of BIM h…

题面 Luogu Sol 整体二分 比较简单,当练手题 每次树状数组统计 # include <bits/stdc++.h> # define RG register # define IL inline # define Fill(a, b) memset(a, b, sizeof(a)) using namespace std; typedef long long ll; const int _(3e5 + 5); IL ll Input(){ RG ll x = 0, z = 1; RG…