BZOJ1568：[JSOI2008]Blue Mary开公司——题解

https://www.lydsy.com/JudgeOnline/problem.php?id=1568

李超线段树（不会的话去网上搜吧……）。

完。

#include<map>
#include<cmath>
#include<stack>
#include<queue>
#include<cstdio>
#include<cctype>
#include<vector>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long double dl;
const int N=;
inline dl read(){
    dl X=,Y=1.0;int w=;char ch=;
    while(!isdigit(ch)){w|=ch=='-';ch=getchar();}
    while(isdigit(ch))X=X*+(ch^),ch=getchar();
    if(ch=='.'){
        ch=getchar();
        while(isdigit(ch))X+=(Y/=)*(ch^),ch=getchar();
    }
    return w?-X:X;
}
struct node{
    int l,r;
    dl yl,yr;
    node(int x1=,dl y1=,int x2=,dl y2=){
        l=x1,r=x2;yl=y1,yr=y2;
    }
    dl k(){return (yr-yl)/(r-l);}
    dl point(int x){return l==r?yl:yl+k()*(x-l);}
    void lm(int x){yl=point(x),l=x;}
    void rm(int x){yr=point(x),r=x;}
}tr[N*];
dl query(int a,int l,int r,int k){
    if(l==r)return tr[a].point(k);
    int mid=(l+r)>>;dl ans;
    if(k<=mid)ans=query(a<<,l,mid,k);
    else ans=query(a<<|,mid+,r,k);
    return max(ans,tr[a].point(k));
}
void insert(int a,int l,int r,node k){
    if(k.l<l)k.lm(l);
    if(r<k.r)k.rm(r);
    int mid=(l+r)>>;
    if(k.point(mid)>tr[a].point(mid))swap(k,tr[a]);
    if(min(tr[a].yl,tr[a].yr)>=max(k.yl,k.yr))return;
    if(l==r)return;
    if(tr[a].k()>k.k())insert(a<<,l,mid,k);
    else insert(a<<|,mid+,r,k);
}
char s[];
int main(){
    int n=read();
    while(n--){
        scanf("%s",s);
        if(s[]=='Q')printf("%d\n",(int)(query(,,,read())/));
        else{
            int x0=,x1=;
            dl y0=read(),k=read(),y1=k*(x1-x0)+y0;
            node p=node(x0,y0,x1,y1);
            insert(,,,p);
        }
    }
    return ;
}

+++++++++++++++++++++++++++++++++++++++++++

+本文作者：luyouqi233。 　　　　　　　　　　　　　　+

+欢迎访问我的博客：http://www.cnblogs.com/luyouqi233/+

+++++++++++++++++++++++++++++++++++++++++++