摘要：这题是给定你一个区间，求里面的第K大的数；这里用到划分树：View Code #include<iostream>#include<cstdio>#include<cstdlib>#include<algorithm>#include<cmath>#include<queue>#include<set>#include<map>#include<cstring>#include<vector>using namespace std;class Node{public: int 阅读全文

摘要：这个也是一道对划分树的简单的运用：View Code #include<iostream>#include<cstdio>#include<cstdlib>#include<algorithm>#include<cmath>#include<queue>#include<set>#include<map>#include<cstring>#include<vector>using namespace std;class Node{public: int num[100024] 阅读全文

摘要：这里要用到划分树求第K大数：View Code #include<iostream>#include<cstdio>#include<cstdlib>#include<algorithm>#include<cmath>#include<queue>#include<set>#include<map>#include<cstring>#include<vector>using namespace std;class Node{public: int num[100024],va 阅读全文