摘要：
丧心病狂的数据结构题、、树链剖分之后用线段树套一个随便什么BST维护第K大值、、Code:#include <iostream>#include <cstdio>#include <algorithm>#include <set>#include <map>#include <queue>#include <vector>#include <cstring>#include <cmath>#include <cstdlib>#include <complex>us 阅读全文
