The 14th Chinese Northeast Collegiate Programming Contest 补题(A.异或二进制位最小生成树 K.二维单调队列 L.二分+最大n维曼哈顿距离)
A.MicroStructureThread(异或二进制位最小生成树)题意比较迷惑,最后转化下来是,确定一个树的点与父亲的排列,使得所求式总代价最小,即求一棵最小生成树,点i和点j连接的代价是popcount(a[i]^a[j])即ai和aj异或的值的二进制位的个数,其中nusingnamespacestd;#definepbpush_backtypedefpairP;constintN=2e5+