aigoruan

摘要： http://acm.hdu.edu.cn/showproblem.php?pid=4417思路：线段树+二分裸奔~~~View Code #include<stdio.h>#include<string.h>#include<iostream>#include<algorithm>using namespace std;const int maxn = 100005;int as[23][maxn*4];int n,m;void build(int rt,int l,int r,int d){ int md=(l+r)>>1; fo 阅读全文