https://acm.ecnu.edu.cn/contest/273/problem/C/
从牛逼网友的博客的评论里学到了https://blog.csdn.net/qq_41730082/article/details/106320914#comments_12333585
cdq分治还能这样写的,学到了,my vegetable exploeded
因为这题是要从前向后面转移最大值,所以如果按照常规cdq的写法,先递归两个子区间,那么就只能某个[l,mid]转移给[mid+1,r]
不能[l,mid]先转移给[mid+1,rmid],在转移给[rmid+1,r]了
那么我们如果把cdq(mid+1,r)放到当前层处理的后面去,就能实现这个操作了。
本来是要归并排序使得mid+1,r按y排好顺序的,既然丢到的后面,由于要归并,所以我们直接sort(q+mid+1,q+r+1,cmp2),
然后进入cdq(mid+1,r)的时候,在开头按第一维 sort,这样保证了cdq的性质了。
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxl=3e5+10;
int n,m,cas,k,xn,ynn,zn,tot,nn;
int b[maxl],tb[maxl],ans[maxl];
ull ax[maxl],ay[maxl],az[maxl];
char s[maxl];
bool in[maxl];
struct que
{
ull x,y,z;
int id;
bool operator < (const que &b)const
{
if(x==b.x)
{
if(y==b.y)
return z<b.z;
return y<b.y;
}
return x<b.x;
}
bool operator == (const que &b)const
{
return x==b.x && y==b.y && z==b.z;
}
}q[maxl],t[maxl],aa[maxl],tmp[maxl];
ull k1,k2;
unsigned long long CoronavirusBeats() {
unsigned long long k3 = k1, k4 = k2;
k1 = k4;
k3 ^= k3 << 23;
k2 = k3 ^ k4 ^ (k3 >> 17) ^ (k4 >> 26);
return k2 + k4;
}
inline void prework()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin>>n;
cin>>k1>>k2;
for(int i=1;i<=n;++i)
{
aa[i].x=CoronavirusBeats();
aa[i].y=CoronavirusBeats();
aa[i].z=CoronavirusBeats();
aa[i].id=i;
ax[i]=aa[i].x;
ay[i]=aa[i].y;
az[i]=aa[i].z;
}
sort(ax+1,ax+1+n);
sort(ay+1,ay+1+n);
sort(az+1,az+1+n);
xn=unique(ax+1,ax+1+n)-ax-1;
ynn=unique(ay+1,ay+1+n)-ay-1;
zn=unique(az+1,az+1+n)-az-1;
for(int i=1;i<=n;i++)
{
aa[i].x=lower_bound(ax+1,ax+1+xn,aa[i].x)-ax;
aa[i].y=lower_bound(ay+1,ay+1+ynn,aa[i].y)-ay;
aa[i].z=lower_bound(az+1,az+1+zn,aa[i].z)-az;
ans[i]=0;
}
sort(aa+1,aa+1+n);
nn=0;
q[++nn]=aa[1];
for(int i=2;i<=n;i++)
if(!(aa[i]==aa[i-1]))
q[++nn]=aa[i];
}
inline void rec(int i)
{
while(i<=zn)
{
tb[i]=b[i];
i+=i&-i;
}
}
inline void recv(int i)
{
while(i<=zn)
{
b[i]=tb[i];
i+=i&-i;
}
}
inline void upd(int i,int x)
{
while(i<=zn)
{
b[i]=max(b[i],x);
i+=i&-i;
}
}
inline int getmx(int i)
{
int ret=-1;
while(i)
{
ret=max(b[i],ret);
i-=i&-i;
}
return ret;
}
inline bool cmp1(const que &a,const que &b)
{
return a.x<b.x;
}
inline bool cmp2(const que &a,const que &b)
{
return a.y<b.y;
}
inline void cdq(int l,int r)
{
if(l==r) return;
sort(q+l,q+r+1,cmp1);
int mid=(l+r)>>1;
cdq(l,mid);
sort(q+l,q+mid+1,cmp2);
sort(q+mid+1,q+r+1,cmp2);
for(int i=l;i<=mid;i++)
rec(q[i].z);
int i=l,j=mid+1,k=l;
while(i<=mid && j<=r)
{
if(q[i].y<=q[j].y)
{
upd(q[i].z,ans[q[i].id]);
t[k++]=q[i++];
}
else
{
ans[q[j].id]=max(ans[q[j].id],getmx(q[j].z)+1);
t[k++]=q[j++];
}
}
while(i<=mid)
{
upd(q[i].z,ans[q[i].id]);
t[k++]=q[i++];
}
while(j<=r)
{
ans[q[j].id]=max(ans[q[j].id],getmx(q[j].z)+1);
t[k++]=q[j++];
}
for(int i=l;i<=mid;i++)
recv(q[i].z);
cdq(mid+1,r);
}
inline void mainwork()
{
for(int i=1;i<=zn;i++)
b[i]=-1;
cdq(1,nn);
}
inline void print()
{
for(int i=2;i<=n;i++)
if(aa[i]==aa[i-1])
ans[aa[i].id]=ans[aa[i-1].id];
int mx=0;
for(int i=1;i<=n;i++)
mx=max(mx,ans[i]+1);
printf("%d\n",mx);
for(int i=1;i<=n;i++)
printf("%d%c",ans[i],(i==n)?'\n':' ');
}
int main()
{
int t=1;
//scanf("%d",&t);
for(cas=1;cas<=t;cas++)
{
prework();
mainwork();
print();
}
return 0;
}