偏序
一维偏序：
二维偏序：排序+树状数组（逆序对）
三维偏序
第一维先sort，第二维由归并保证，第三维在归并时查询权值树状数组。
洛谷P3810 【模板】三维偏序（陌上花开）
洛谷题解：https://www.luogu.com.cn/blog/handsome-wzb/solution-p3810
#include<cstdio>
#include<algorithm>
#define maxn 200005
using namespace std;
struct node
{
int a,b,c,cnt,ans;
}s1[maxn],s2[maxn];
int n,m,k,mx,top,su[maxn];
int c[maxn];//树状数组
bool cmp1(node x,node y)
{
if(x.a==y.a)
{
if(x.b==y.b)return x.c<y.c;
else return x.b<y.b;
}
else return x.a<y.a;
}//第一维排序
bool cmp2(node x,node y)
{
if(x.b==y.b)
return x.c<y.c;
else return x.b<y.b;
}//第二维排序
int lowbit(int x)
{
return x&(-x);
}
void add(int x,int y)
{
while(x<=mx)
{
c[x]+=y;
x+=lowbit(x);
}
}//树状数组单点加
int query(int x)
{
int sum=0;
while(x)
{
sum+=c[x];
x-=lowbit(x);
}
return sum;
}//求单点前缀和
//树状数组看得懂吧QAQ
void cdq(int l,int r)
{
if(l==r)return;
int mid=(l+r)>>1;
cdq(l,mid);
cdq(mid+1,r);//类似于归并排序
sort(s2+l,s2+mid+1,cmp2);
sort(s2+mid+1,s2+r+1,cmp2);//第二维为关键字排序
int i,j=l;
for(i=mid+1;i<=r;++i)
{
while(s2[i].b>=s2[j].b&&j<=mid)
{
add(s2[j].c,s2[j].cnt);//在s2[j]位置加上s2[j]的个数
j++;
}
s2[i].ans+=query(s2[i].c);//保证树状数组里的数一定符合条件
}//类似归并
for(i=l;i<j;++i)
add(s2[i].c,-s2[i].cnt);//清空树状数组
}//cdq分治
int main()
{
scanf("%d%d",&n,&k);
mx=k;//树状数组的区间
for(int i=1;i<=n;++i)
{
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
s1[i].a=a;
s1[i].b=b;
s1[i].c=c;
}//初始化输入
sort(s1+1,s1+1+n,cmp1);//第一维为关键字排序
for(int i=1;i<=n;++i)
{
top++;
if(s1[i].a!=s1[i+1].a||s1[i].b!=s1[i+1].b||s1[i].c!=s1[i+1].c)
{
m++;
s2[m].a=s1[i].a;
s2[m].b=s1[i].b;
s2[m].c=s1[i].c;
s2[m].cnt=top;
top=0;
}
}//第一维已有序,合并相同节点
cdq(1,m);//cdq分治
for(int i=1;i<=m;++i)
su[s2[i].ans+s2[i].cnt-1]+=s2[i].cnt;
for(int i=0;i<n;++i)
printf("%d\n",su[i]);
return 0;
}
洛谷P3157 【[CQOI2011]动态逆序对】
洛谷题解：https://www.luogu.com.cn/blog/codinging/solution-p3157
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int maxq=2e5+9;
struct query{
int id,time,val;//序列位置,被删时间,值
}q[maxq],tmp[maxq];
int n,m;
int aid=0,a[maxq],ans[maxq],poi[maxq];
int c[maxq];int vis[maxq];
#define lowbit(x) (x&(-x))
void add(int i,int x){for(;i<=n;i+=lowbit(i)) c[i]+=x;}
int sum(int i){int ret=0;for(;i;i-=lowbit(i)) ret+=c[i];return ret;}
void clr(int i){for(;i<=n;i+=lowbit(i)) c[i]=0;}
inline bool cmp(query &a,query &b){
return a.time>b.time;
}
int pre(){
int ret=0;
for(int i=n;i>=1;i--){
ret+=sum(a[i]-1);
add(a[i],1);
}
memset(c,0,sizeof(c));
return ret;
}
void cdq(int l,int r){//大,前,删除时间晚。
if(l==r) return;
int mid=(l+r)>>1;
cdq(l,mid),cdq(mid+1,r);
int i=l,j=mid+1,k=l;
while(i<=mid && j<=r){
if(q[i].id<q[j].id){
add(q[i].val,1);
tmp[k++]=q[i++];
}
else{
ans[q[j].time]+=sum(n)-sum(q[j].val);
tmp[k++]=q[j++];
}
}
while(i<=mid) tmp[k++]=q[i++];
while(j<=r){
ans[q[j].time]+=sum(n)-sum(q[j].val);
tmp[k++]=q[j++];
}
for(int i=l;i<=mid;i++){
clr(q[i].val),q[i]=tmp[i];
}
for(int i=mid+1;i<=r;i++) q[i]=tmp[i];
}
void cdq1(int l,int r){//小,后,删除时间晚。
if(l==r) return;
int mid=(l+r)>>1;
cdq1(l,mid),cdq1(mid+1,r);
int i=l,j=mid+1,k=l;
while(i<=mid && j<=r){
if(q[i].id>q[j].id){
add(q[i].val,1);
tmp[k++]=q[i++];
}
else{
ans[q[j].time]+=sum(q[j].val-1);
tmp[k++]=q[j++];
}
}
while(i<=mid) tmp[k++]=q[i++];
while(j<=r){
ans[q[j].time]+=sum(q[j].val-1);
tmp[k++]=q[j++];
}
for(int i=l;i<=mid;i++){
clr(q[i].val),q[i]=tmp[i];
}
for(int i=mid+1;i<=r;i++) q[i]=tmp[i];
}
#undef int
int main(){
cin>>n>>m;
for(int i=1,x;i<=n;i++){
scanf("%d",&x);poi[x]=i;
a[i]=x;
q[++aid]=(query){i,2e5,x};
}
for(int i=1,x;i<=m;i++){
scanf("%d",&x);
q[poi[x]].time=i;
}
ans[0]=pre();
sort(q+1,q+1+aid,cmp);
cdq(1,aid);
sort(q+1,q+1+aid,cmp);
cdq1(1,aid);
printf("%lld\n",ans[0]);
for(int i=1;i<=m-1;i++){
ans[i]=ans[i-1]-ans[i];
printf("%lld\n",ans[i]);
}
return 0;
}
BZOJ1176
#include <bits/stdc++.h>
using namespace std;
const int maxn=50010;
long long w,n,cnt,opt,x,xx,y,yy;
long long s,ans[maxn],vv,a[50*maxn];
struct da{int op,x,y;long long v;int id;}q[50*maxn];
da f(int a,int b,int c,long long d,int e)
{
da x;
x.op=a;x.x=b;x.y=c;x.v=d;x.id=e;
return x;
}
bool cmp(da aa,da bb){return aa.x<bb.x;}
inline int lowbit(int x){return x&(-x);}
void add(int x,long long k){while (x<=w+1) {a[x]+=k; x+=lowbit(x);}}
long long qury(int x){long long sum=0;while (x) {sum+=a[x]; x-=lowbit(x);} return sum;}
void cdq(int l,int r)
{
if (l==r) return;
int mid=(l+r)>>1;
cdq(l,mid); cdq(mid+1,r);sort(q+l,q+mid+1,cmp); sort(q+mid+1,q+r+1,cmp);
int p1=l,p2=mid+1;
while (p2<=r)
{
while (p1<=mid && q[p1].x<=q[p2].x)
{
if (q[p1].op==1)
add(q[p1].y,q[p1].v);
p1++;
}
if (q[p2].op==2)
ans[q[p2].id]+=qury(q[p2].y)*q[p2].v;
p2++;
}
p1=l; p2=mid+1;
while (p2<=r)
{
while (p1<=mid && q[p1].x<=q[p2].x) {if (q[p1].op==1) add(q[p1].y,-q[p1].v); p1++;}
p2++;
}
}
int main()
{
scanf("%lld%d",&s,&w);
while (scanf("%d",&opt) && opt!=3)
{
if (opt==1) {scanf("%d%d%lld",&x,&y,&vv); x++; y++; q[++n]=f(1,x,y,vv,0);}
else
{
scanf("%d%d%d%d",&x,&y,&xx,&yy); cnt++; x++; y++; xx++; yy++;
q[++n]=f(2,x-1,y-1,1,cnt); q[++n]=f(2,xx,yy,1,cnt);
q[++n]=f(2,x-1,yy,-1,cnt); q[++n]=f(2,xx,y-1,-1,cnt);
}
}
cdq(1,n); for (int i=1;i<=cnt;i++) printf("%lld\n",ans[i]+s);
return 0;
}
基于值域的整体分治
poj2104 K-th Number 【整体分治+树状数组】
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define ll long long
#define gc getchar
inline int read(){
int f=1,res=0;char ch=gc();
while(!isdigit(ch)) f^=ch=='-',ch=gc();
while(isdigit(ch)) res=(res<<1)+(res<<3)+(ch^48),ch=gc();
return f?res:-res;
}
const int N=100010,INF=1000000000;
struct rec{int op,x,y,z;}q[2*N],lq[N],rq[2*N];
int n,m,t,c[N],ans[N];
int lowbit(int x){return x&-x;}
int ask(int x){
int sum=0;
for(;x;x-=lowbit(x)) sum+=c[x];
return sum;
}
void change(int x,int y){
for(;x<=n;x+=lowbit(x)) c[x]+=y;
}
void solve(int lval,int rval,int st,int ed){
if(st>ed) return;
if(lval==rval){
for(int i=st;i<=ed;i++)
if(q[i].op>0) ans[q[i].op]=lval;
return;
}
int mid=(lval+rval)>>1;
int lt=0,rt=0;
for(int i=st;i<=ed;i++){
if(q[i].op==0){
if(q[i].y<=mid) change(q[i].x,1),lq[++lt]=q[i];
else rq[++rt]=q[i];
}
else{
int cnt=ask(q[i].y)-ask(q[i].x-1);
if(cnt>=q[i].z) lq[++lt]=q[i];
else q[i].z-=cnt,rq[++rt]=q[i];
}
}
for(int i=ed;i>=st;i--){
if(q[i].op==0&&q[i].y<=mid) change(q[i].x,-1);
}
for(int i=1;i<=lt;i++) q[st+i-1] = lq[i];
for(int i=1;i<=rt;i++) q[st+lt+i-1]=rq[i];
solve(lval,mid,st,st+lt-1);
solve(mid+1,rval,st+lt,ed);
}
int main(){
n=read(),m=read();
for(int i=1;i<=n;i++) {
int val=read();
q[++t].op=0,q[t].x=i,q[t].y=val;
}
for(int i=1;i<=m;i++){
int l=read(),r=read(),k=read();
q[++t].op=i,q[t].x=l,q[t].y=r,q[t].z=k;
}
solve(-INF,INF,1,t);
for(int i=1;i<=m;i++) printf("%d\n",ans[i]);
return 0;
}
BZOJ2783 矩阵乘法
整体二分+二维树状数组
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1010, M = 1e6 + 10;
struct Node {
int x, y, u, v, k, id;
//(x,y)(u,v)矩阵左上，右下角
} q[M + N], q1[N + M], q2[N + M];
int tot = 0, n, m, tree[N][N], ans[M];
//树状数组
inline void add(int x, int y, int v) { //修改
for (int i = x; i <= n; i += i & -i)
for (int j = y; j <= n; j += j & -j)
tree[i][j] += v;
return ;
}
inline int query(int x, int y) { //查询二维前缀和
int res = 0;
for (int i = x; i; i -= i & -i)
for (int j = y; j; j -= j & -j)
res += tree[i][j];
return res;
}
inline void solve(int ql, int qr, int L, int R) {
if (ql > qr)
return ;
if (L == R) { //规模缩小为一个数
for (int i = ql; i <= qr; ++ i) //记录答案
if (q[i].id != 0) ans[q[i].id] = L;
return ;
}
int len1, len2, mid = (L + R) >> 1;
len1 = len2 = 0;
for (int i = ql; i <= qr; ++ i) {
if(q[i].id == 0) {
if (q[i].k <= mid) {
add(q[i].x, q[i].y, 1);
q1[++ len1] = q[i];
} else {
q2[++ len2] = q[i];
}
} else {
int tmp = query(q[i].u, q[i].v) - query(q[i].x - 1, q[i].v) - query(q[i].u, q[i].y - 1) + query(q[i].x - 1, q[i].y - 1); //提取子矩阵
if (tmp >= q[i].k) {
q1[++ len1] = q[i];
} else {
q[i].k -= tmp;
q2[++ len2] = q[i];
}
}
}
for (int i = 1; i <= len1; ++ i) q[ql + i - 1] = q1[i];
for (int i = 1; i <= len2; ++ i) q[ql + len1 + i - 1] = q2[i];
for (int i = ql; i <= ql + len1 - 1; ++ i)
if (q[i].id == 0 && q[i].k <= mid)
add(q[i].x, q[i].y, -1);
solve(ql, ql + len1 - 1, L, mid);
solve(ql + len1, qr, mid + 1, R);
}
inline int read() {
int x = 0, f = 1; char ch = getchar();
while(!isdigit(ch)) { if(ch == '-') f = -f; ch = getchar(); }
while(isdigit(ch)) { x = (x << 1) + (x << 3) + (ch ^ 48); ch = getchar(); }
return x * f;
}
#undef int
int main() {
n = read(); m = read();
for (int x, i = 1; i <= n; ++ i)
for (int j = 1; j <= n; ++ j) {
x = read();
q[++ tot] = (Node) {i, j, 0, 0, x, 0};
}
for (int x, y, a, b, k, i = 1; i <= m; ++ i) {
x = read(); y = read();
a = read(); b = read();
k = read();
q[++ tot] = (Node) {x, y, a, b, k, i};
}
solve(1, tot, INT_MIN, INT_MAX);
for (int i = 1; i <= m; ++ i)
printf("%d\n", ans[i]);
return 0;
}
相关习题：BZOJ 2527 Meteors
145
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
