[Luogu] 送花

https://www.luogu.org/problemnew/show/2073

自己yy，明显错

#include <bits/stdc++.h>
 
using namespace std;
const int N = 1e5 + ;
const int oo = ;
 
#define gc getchar()
 
struct Node{
    int w, b, bef;
}flower[N];
int Ans1, Ans2, opt, W, B, Max, Min;
map<int, bool> Map;
int js = , tot = ;
 
inline int read(){
    int x = , f = ; char c = gc;
    while(c < '' || c > '') {if(c == '-') f = -; c = gc;}
    while(c >= '' && c <= '') x = x *  + c - '', c = gc;
    return x * f;
}
 
int main()
{
    Max = ;
    Min = ;
    opt = read();
    while(opt != ) opt = read();
    flower[Max].w = read(); flower[Max].b = read(); Map[flower[Max].w] = ;
    flower[Max].bef = ;
    while(true){
        opt = read();
        if(opt == -) break;
        if(opt == ){
            flower[++ js].w = read(); flower[js].b = read();
            W = flower[js].w; B = flower[js].b;
            if(Map[W]) {js --; continue ;} else tot ++, Map[W] = ;
            if(W > flower[Max].w || ! flower[Max].w) {flower[js].bef = Max; Max = js;}
            if(W < flower[Min].w || ! flower[Min].w) {flower[js].bef = Min; Min = js;}
        }
        else if(opt == ){
            if(tot <= ) continue;
            int ma = Max;
            Map[flower[Max].w] = ;
            flower[Max].w = ; flower[Max].b = ;
            Max = flower[ma].bef; flower[ma].bef = ;
            tot --;
        }
        else {
            if(tot <= ) continue;
            int mi = Min;
            Map[flower[Min].w] = ;
            flower[Min].w = ; flower[Min].b = ;
            Min = flower[mi].bef; flower[mi].bef = ;
            tot --;
        }
    }
    for(int i = ; i<= N - ; i ++)
    Ans1 += flower[i].w, Ans2 += flower[i].b;
    cout << Ans1 << " " << Ans2;
 
    return ;
}
/*
1 2 2
1 7 20
3
1 16 3
1 2 16
2
-1
 
*/

以权值为下标建立权值线段树

#include<cmath>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define ls jd<<1
#define rs jd<<1|1
 
using namespace std;
const int N = 1e6 + ;
const int inf = 0x7f7f7f7f;
 
int opt;
bool vis[N];//用来判重；
struct Tree {int l, r, sumw, sumc, Min,Max;} T[N<<];
 
void build(int jd, int ll, int rr) {
    T[jd].l = ll, T[jd].r = rr, T[jd].Min = inf;
    if(ll == rr) return;
    int m = ll + rr >> ;
    build(ls, ll, m), build(rs, m + , rr);
}
 
void update(int jd, int pos, int val1, int val2, int val3, int val4) {
    if(T[jd].l == pos && T[jd].r == pos) {
        T[jd].sumc = val1;
        T[jd].sumw = val2;
        T[jd].Min = val3;
        T[jd].Max = val4;
        return;
    }
    if(T[ls].r >= pos) update(ls, pos, val1, val2, val3, val4);
    else update(rs, pos, val1, val2, val3, val4);
    T[jd].sumc = T[ls].sumc + T[rs].sumc;
    T[jd].sumw = T[ls].sumw + T[rs].sumw;
    T[jd].Min = min(T[ls].Min, T[rs].Min);
    T[jd].Max = max(T[ls].Max, T[rs].Max);
}
 
int main()
{
    int n = N - ;
    build(, , n);
    while(scanf("%d", &opt) ==  && opt != -) {
        int w, c;
        if(opt == ) {
            scanf("%d %d", &w, &c);
            if(vis[c]) continue;
            update(, c, c, w, c, c);
            vis[c] = true;
        }
        if(opt == ) {
            if(T[].Min == inf) continue;//此时无花，下同；
            vis[T[].Min] = false, update(, T[].Min, , , inf, );
        }
        if(opt == ) {
            if(T[].Max == ) continue;
            vis[T[].Max] = false, update(, T[].Max, , , inf, );
        }
    }
    printf("%d %d",T[].sumw, T[].sumc);
}