AC通道:http://www.lydsy.com/JudgeOnline/problem.php?id=3262
【易错点分析】
相信会写CDQ分治的人都会这道题,所以我就来讲一讲博主在做题时遇到的错误(ps:静态查错大法好)
1、tb的右端点多次打成r
2、排序过程中忘记定义z的优先级
3、被题目所坑:考虑两个属性值相同的花,它们的美丽值可以互相超过。。。所以要把相同的花缩成权值的形式
4、注意把相同点缩完后,最后输出答案有n个,要swap(top,n)
总结:博主犯了四个大错误,但是使用静态查错法在半个小时内解决了所有错误,所以静态查错大法好!!!
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<cmath>
#include<algorithm>
using namespace std;
#define FILE "read"
#define MAXN 100010
#define up(i,j,n) for(int i=j;i<=n;++i)
#define dn(i,j,n) for(int i=j;i>=n;--i)
#define cmax(a,b) a=max(a,b)
#define cmin(a,b) a=min(a,b)
struct node{
int x,y,z,ans,w;
bool operator<(const node &b)const{return x<b.x||(x==b.x&&y<b.y)||(x==b.x&&y==b.y&&z<b.z);}
}a[MAXN],stack[MAXN];
int n,K,level[MAXN],tr[MAXN*2];
namespace INIT{
char buf[1<<15],*fs,*ft;
inline char getc(){return (fs==ft&&(ft=(fs=buf)+fread(buf,1,1<<15,stdin),fs==ft))?0:*fs++;}
inline int read(){
int x=0,f=1; char ch=getc();
while(!isdigit(ch)) {if(ch=='-') f=-1; ch=getc();}
while(isdigit(ch)) {x=(x<<3)+(x<<1)+ch-'0'; ch=getc();}
return x*f;
}
}using namespace INIT;
void add(int x,int v){while(x<=K)tr[x]+=v,x+=(x&-x);}
int get(int x){int sum(0);while(x)sum+=tr[x],x-=(x&-x);return sum;}
void CDQ(int l,int r){
if(l>=r) return;
int mid=(l+r)>>1,ta(l),tb(mid+1),top(0);
CDQ(l,mid); CDQ(mid+1,r);
while(ta<=mid&&tb<=r){
while(ta<=mid&&a[ta].y<=a[tb].y) add(a[ta].z,a[ta].w),stack[++top]=a[ta++];
while(tb<=r&&a[ta].y>a[tb].y) a[tb].ans+=get(a[tb].z),stack[++top]=a[tb++];
}
while(ta<=mid) add(a[ta].z,a[ta].w),stack[++top]=a[ta++];
while(tb<=r) a[tb].ans+=get(a[tb].z),stack[++top]=a[tb++];
up(i,l,mid) add(a[i].z,-a[i].w);
up(i,l,r) a[i]=stack[i-l+1];
}
int main(){
freopen(FILE".in","r",stdin);
freopen(FILE".out","w",stdout);
n=read(); K=read();
up(i,1,n) a[i].x=read(),a[i].y=read(),a[i].z=read(),a[i].w=1;
sort(a+1,a+n+1); int top(0);
up(i,1,n){
if(i==1||a[i-1]<a[i]) a[++top]=a[i];
else a[top].w++;
}
swap(n,top); CDQ(1,n);
up(i,1,n) level[a[i].ans+a[i].w]+=a[i].w;
up(i,1,top) printf("%d\n",level[i]);
return 0;
}