UOJ round13 T2Ernd

%popoqqq

两个转移f[i]=f[j]+1 j->i  f[i]=f[j]+(i-j+1)*(i-j+1) 

第一个将原坐标系(ai,bi)转成(bi-ai,ai+bi) 然后发现按照二维偏序转移

可以用不等式证明？相对顺序不变

然后第二种用斜率优化

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#define LL long long
using namespace std;
const int N=500000+100;
struct node{
	int x,y,id;
	node(){}
	node(int x,int y,int id):x(x),y(y),id(id) {}
}p[N];
LL dp[N],c[N],ans;
int a[N],b[N],g[N],n;
bool f[N];
LL Y(int x){return dp[x]+(LL)x*x-2*x;}
bool cmp1(node a,node b){
	return a.y<b.y;
}
bool cmp2(node a,node b){
	return (a.x<b.x)||(a.x==b.x&&a.y<b.y);
}
void add(int x,LL w){
	for(;x<=n;x+=(x&(-x)))
		c[x]=max(c[x],w);
}
LL ask(int x){
	LL res=0;
	for(;x;x-=(x&(-x)))
		res=max(res,c[x]);
	return res;
}
LL Dp(int j,int i){
	return dp[j]-1+(LL)(i-j+1)*(i-j+1);
}
bool judge(int i,int j,int k){
	return (Y(k)-Y(j))*(j-i)>=(Y(j)-Y(i))*(k-j);
}
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;b[i]+=a[i],i++){
		scanf("%d%d",&a[i],&b[i]);
		p[i]=node(b[i]-a[i],b[i]+a[i],i);
		f[i]=(p[i].x>=p[i-1].x&&p[i].y>=p[i-1].y&&i!=1);
	}
	sort(p+1,p+1+n,cmp1);
	p[1].y=1;
	for(int i=2;i<=n;i++) p[i].y=p[i-1].y+(b[p[i].id]>b[p[i-1].id]);
	sort(p+1,p+1+n,cmp2);
	for(int i=1;i<=n;i++){
		int pos=p[i].id;
		LL res=ask(p[i].y);res++;
		if(f[pos]){
			int j=pos-1;
			while(g[j]&&Dp(g[j],pos)>=Dp(j,pos)) j=g[j];
			res=max(res,Dp(j,pos));
			while(g[j]&&judge(g[j],j,pos)) j=g[j];
			g[pos]=j;
		}
		add(p[i].y,res);
		ans=max(ans,dp[pos]=res);
	}
	printf("%lld",ans);
	return 0;
}