poj 2104 区间第k大

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fod(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
const int N=1e5+10,logN=18;
struct Node
{
    int sum;
    Node *ch[2],*fa;
}node[N*logN],*root[N];