zoj 3612 ——Median

题意：在一个数组中加入或删除元素，求每次操作以后这个数组的中位数。
思路：本来应该是平衡二叉树，发现不会写，后来想想用线段树来写了一个。先把所有操作都读进来，然后把数字离散化，然后在线段树上面操作。
代码如下：

#include<cstdio>
#include<cstdlib>
#include<math.h>
#include<iostream>
#include<cstring>
#include<map>
#include<set>
#include<list>
#include<stack>
#include<algorithm>
#include<queue>
#include<vector>
#include<time.h>
#include<iomanip>
using namespace std;

typedef long long ll;

const int maxn = 10005;
char op[maxn][20];
ll num[maxn];
ll sav[maxn];

int cnt[maxn];
int Tree[maxn*5];
int n;
void update(int l,int r,int o,int x,int add)
{
    if(x<0||x>=n){
        while(1);
    }
    if(l == r && l == x){
        Tree[o]+=add;
        return;
    }
    int m = (l+r)/2;
    if(x<=m){
        update(l,m,o*2,x,add);
    } else update(m+1,r,o*2+1,x,add);
    Tree[o] = Tree[o*2]+Tree[o*2+1];
}

int query(int l,int r,int o,int sum)
{
    if(l == r &&Tree[o]>=sum)return l;
    int m = (l+r)/2;
    if(Tree[o*2]>=sum){
        return query(l,m,o*2,sum);
    } else {
        return query(m+1,r,o*2+1,sum - Tree[o*2]);
    }
}


int bisearch(int x)
{
    int l = 0;
    int r = n-1;
    while(l<=r){
        int mid = (l+r)/2;
        if(sav[mid]== x){
            return mid;
        }
        if(sav[mid]<x){
            l = mid +1;
        } else r = mid -1;
    }
    return -1;
}

void printmid()
{
    int tot = Tree[1];
    if(tot&1){
        int pos = query(0,n-1,1,tot/2+1);
        cout<<sav[pos]<<endl;
    } else {
        int pos1 = query(0,n-1,1,tot/2);
        int pos2 = query(0,n-1,1,tot/2+1);
        ll ans = (ll)sav[pos1]+(ll)sav[pos2];ans>>=1;
        if(ans*2 == sav[pos1]+sav[pos2]){
            cout<<ans;
        } else {
            printf("%.1lf",(sav[pos1]+sav[pos2])/2.0);
        }
        puts("");
    }
}

int main()
{
//    freopen("data.txt","r",stdin);
    int T;
    scanf("%d",&T);
    while(T--){
        scanf("%d",&n);
        for(int i = 0;i<n;++i){
            scanf("%s",op[i]);
            cin>>num[i];
            sav[i] = num[i];
        }
        sort(sav,sav+n);
        memset(cnt,0,sizeof(cnt));
        memset(Tree,0,sizeof(Tree));
        for(int i = 0 ;i<n;++i){
            if(strcmp(op[i],"remove") == 0){
                int t = bisearch(num[i]);
                if(cnt[t] == 0){
                    puts("Wrong!");continue;
                }
                cnt[t]--;
                update(0,n-1,1,t,-1);
                if(Tree[1] == 0){
                    puts("Empty!");
                } else {
                    printmid();
                }
            } else {
                int t = bisearch(num[i]);
                cnt[t]++;
                update(0,n-1,1,t,1);
                printmid();
            }
        }
    }
    return 0 ;
}