P4254 [JSOI2008]Blue Mary开公司（射线版的李超线段树）

注意结构体的构造函数如果不用默认构造函数的话会很慢。

#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000005;
const double eps = 1e-6;
int sgn( double x ){
    if( x > eps ) return 1;
    else if( x < -eps ) return -1;
    else return 0;
}
struct Line{
    int id;
    double k,b;
    Line(){}
    Line( double _k,double _b,int _id ){
        k = _k;b = _b;id = _id;
    }
    double operator()( int x ){ return k*x+b; }
}a[maxn];
int tree[4*maxn];
bool cmp( int x,int y,int i ){
    return sgn(a[x](i) - a[y](i)) > 0 ;
}
int tot = 1,ls[4*maxn],rs[4*maxn];
int query( int p,int l,int r,int x ){
    if( l == r ) {
        return tree[x];
    }
    int tmp = 0;
    int mid = l+r>>1;
    if( ls[x] &&p <= mid ) tmp = query( p,l,mid,ls[x] );
    else if( rs[x] &&p > mid ) tmp = query( p,mid+1,r,rs[x] ); //  离散化李超线段树，当左右儿子都没有被更新过，就直接return
    if( !tmp  ) return tree[x];
    else if( !tree[x] ){
        return tmp;
    }else if( tree[x] && tmp ){
        return cmp( tmp,tree[x],p ) ? tmp : tree[x];
    }else return tree[x];
}
void update( int k,int l,int r,int x ){
    int mid = l+r>>1;
    if( !tree[x] ) {
        tree[x] = k;
        return;
    }
    if( cmp( k,tree[x],mid )   ) swap( tree[x],k );
    double r1 = a[tree[x]](r),r2 = a[k](r),l1 = a[tree[x]](l),l2 = a[k](l);
    if( sgn( r1-r2 ) >= 0 && sgn( l1-l2 ) >= 0 ){
        return;
    }
    if(  sgn(l2-l1) >= 0 ){
        if(!ls[x])ls[x] = ++tot;
        if(l!=r)update( k,l,mid,ls[x] );   // l r 的判断不可少
    }
    if(  sgn(r2-r1) >= 0 ) {
        if(!rs[x])rs[x] = ++tot;
        if(l!=r)update( k,mid+1,r,rs[x] );  // l,r的判断不可少
    }
}
int main(){
    int n,num = 0;
    double k,b;
    scanf("%d",&n);
    char ss[10];
    for( int i = 1;i <= n;i++ ){
        scanf("%s",ss);
        if( ss[0] == 'P' ){
            scanf("%lf%lf",&b,&k);
            a[++num] = Line( k,b,num );
            update( num,0,500002,1 );
        }else{
            int t;
            scanf("%d",&t);t--;
            int id = query( t,0,500002,1 );
            if(!id) {
                puts("0");continue;
            }
            double res = a[id]( t );
            res /= 100;
            printf("%lld\n",max(0LL,(long long)res));
        }
    }
    return 0;
}