【BZOJ #1568】 [JSOI2008]Blue Mary开公司（李超树）

传送门

李超树板子
具体是利用两个线段最多只有一个交点的性质
对于每个区间维护最优线段并标记持久化

具体实现可以看代码
复杂度小常数$O(nlo{g}^{2}n)$

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define bg begin
#define pii pair<int,int>
#define fi first
#define cs const
#define se second
#define pb push_back
#define y1 shinkle
cs int RLEN=1<<20|1;
inline char gc(){
	static char ibuf[RLEN],*ib,*ob;
	(ib==ob)&&(ob=(ib=ibuf)+fread(ibuf,1,RLEN,stdin));
	return (ib==ob)?EOF:*ib++;
}
#define gc getchar
inline int read(){
	char ch=gc();
	int res=0;bool f=1;
	while(!isdigit(ch))f^=ch=='-',ch=gc();
	while(isdigit(ch))res=(res+(res<<2)<<1)+(ch^48),ch=gc();
	return f?res:-res;
}
inline ll readll(){
	char ch=gc();
	ll res=0;bool f=1;
	while(!isdigit(ch))f^=ch=='-',ch=gc();
	while(isdigit(ch))res=(res+(res<<2)<<1)+(ch^48),ch=gc();
	return f?res:-res;
}
inline int readstring(char *s){
	int top=0;char ch=gc();
	while(isspace(ch))ch=gc();
	while(!isspace(ch)&&ch!=EOF)s[++top]=ch,ch=gc();
	return top;
}
template<typename tp>inline void chemx(tp &a,tp b){a=max(a,b);}
template<typename tp>inline void chemn(tp &a,tp b){a=min(a,b);}
cs int N=100005;
struct line{
	double k,b;
	inline double f(int x){return k*x+b;}
};
int n;
namespace Seg{
	cs int N=50005<<2;
	line tr[N];int vis[N];
	#define lc (u<<1)
	#define rc ((u<<1)|1)
	#define mid ((l+r)>>1)
	void update(int u,int l,int r,int st,int des,line k){
		if(st<=l&&r<=des){
			if(!vis[u]){
				vis[u]=1,tr[u]=k;return;
			}
			else if(tr[u].f(l)<=k.f(l)&&tr[u].f(r)<=k.f(r))tr[u]=k;
			else if(tr[u].f(l)<=k.f(l)||tr[u].f(r)<=k.f(r)){
				if(tr[u].f(mid)<=k.f(mid))swap(tr[u],k);
				if(tr[u].f(l)<k.f(l))update(lc,l,mid,st,des,k);
				else update(rc,mid+1,r,st,des,k);
			}
			return ;
		}
		if(st<=mid)update(lc,l,mid,st,des,k);
		if(mid<des)update(rc,mid+1,r,st,des,k);
	}
	double query(int u,int l,int r,int p){
		double res=tr[u].f(p);
		if(l==r)return res;
		if(p<=mid)return max(res,query(lc,l,mid,p));
		else return max(res,query(rc,mid+1,r,p));
	}
	#undef lc
	#undef rc
	#undef mid
}
char str[10];
int main(){
	#ifdef Stargazer
	freopen("lx.in","r",stdin);
	#endif
	n=read();
	while(n--){
		readstring(str);
		if(str[1]=='P'){
			line x;scanf("%lf%lf",&x.b,&x.k);
			x.b-=x.k;
			Seg::update(1,1,5e4,1,5e4,x);
		}
		else{
			int t=read();
			ll res=(ll)floor(Seg::query(1,1,5e4,t)*0.01);
			cout<<res<<'\n';
		}
	}
}