【 [JSOI2008]Blue Mary开公司 】李超线段树

BZOJ1568

第二棵李超树
竟然题目给的是第一天的收益 那么第 t 天的收益就是 y = k*(x-1) + b;

/*
    if you can't see the repay
    Why not just work step by step
    rubbish is relaxed
    to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
//#pragma comment(linker, "/STACK:10240000,10240000")
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))

typedef pair<int,int> pll;
typedef long long ll;
typedef unsigned long long ull;
const ull hash1 = 201326611;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod =  (int)1e9+7;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){ll ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
void exgcd(ll a,ll b,ll &x,ll &y,ll &d){if(!b) {d = a;x = 1;y=0;}else{exgcd(b,a%b,y,x,d);y-=x*(a/b);}}//printf("%lld*a + %lld*b = %lld\n", x, y, d);
//ull ha[MAX_N],pp[MAX_N];

inline int read()
{
    int date = 0,m = 1; char ch = 0;
    while(ch!='-'&&(ch<'0'|ch>'9'))ch = getchar();
    if(ch=='-'){m = -1; ch = getchar();}
    while(ch>='0' && ch<='9')
    {
        date = date*10+ch-'0';
        ch = getchar();
    }return date*m;
}

/*namespace sgt
{
    #define mid ((l+r)>>1)

    #undef mid
}*/
const int MAX_N = 50025;
const int N = 50000;
double K[MAX_N<<2],B[MAX_N<<2];
bool col[MAX_N<<2];
void build(int rt,int l,int r)
{
    col[rt] = K[rt] = B[rt] = 0;
    if(l==r) return;
    int mid = (l+r)>>1;
    build(rt<<1,l,mid);
    build(rt<<1|1,mid+1,r);
}
void update(int rt,int l,int r,double nk,double nb)
{
    if(!col[rt]) {col[rt] = 1,K[rt] = nk,B[rt] = nb;return;}
    if(nk>K[rt]) swap(nk,K[rt]),swap(nb,B[rt]);
    int mid = (l+r)>>1;
    if(K[rt]*mid+B[rt]>nk*mid+nb)
    {
        if(l!=r) update(rt<<1,l,mid,nk,nb);
    }
    else
    {
        swap(nk,K[rt]),swap(nb,B[rt]);
        if(l!=r) update(rt<<1|1,mid+1,r,nk,nb);
    }
}
double query(int rt,int l,int r,int x)
{
    double Y = K[rt]*x+B[rt];
    if(l==r) return Y;
    int mid = (l+r)>>1;
    if(x<=mid) return max(Y,query(rt<<1,l,mid,x));
    if(x>mid) return max(Y,query(rt<<1|1,mid+1,r,x));
}


int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    int t;char opt[10];
    scanf("%d",&t);
    build(1,1,N);
    while(t--)
    {
        scanf("%s",opt);
        if(opt[0]=='P')
        {
            double a,b;
            scanf("%lf%lf",&a,&b);
            update(1,1,N,b,a);
        }
        else
        {
            int d;
            scanf("%d",&d);
            printf("%d\n",((int)(0.0000001+query(1,1,N,d-1)))/100);
        }
    }
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}