摘要： 划分树 + 二分二分枚举第k小的数与h比较大小。#include <stdio.h>#include <string.h>#include <stdlib.h>#include <algorithm>using namespace std;const int MAXN = 100100;struct Node{ int l, r;}T[MAXN << 2];int d[MAXN], s[MAXN], t[35][MAXN], tol[35][MAXN];void build(int level, int rt, int l, int 阅读全文