Press's Code

Press's Code

#include<bits/stdc++.h>
using namespace std;
#define P pair<int,int>
#define fir first
#define sec second
const int maxn=5*1e5;
const int inf=1e9;
int n,m;
P a[maxn+5];
int f[maxn+5];
int g[maxn+5];
int ans;
inline bool Cmp(P x,P y){
	return x.fir<y.fir||(x.fir==y.fir&&x.sec>y.sec);
}
signed main(){
	int x,y;
	scanf("%d%d",&n,&m);
	for(int i=1;i<=m;i++) scanf("%d",&a[i].fir);
	for(int i=1;i<=m;i++) scanf("%d",&a[i].sec);
	for(int i=1;i<=m;i++) x=inf-a[i].fir,y=a[i].sec,a[i]={y-x,y+x};
	sort(a+1,a+m+1,Cmp);
	memset(g,0x7f,sizeof(g));
	g[0]=0;
	for(int i=1;i<=m;i++){
		f[i]=lower_bound(g+1,g+m+1,a[i].sec)-g;
		ans=max(ans,f[i]);
		g[f[i]]=min(g[f[i]],a[i].sec);
	}
	printf("%d",ans);
	return 0;
}