YJP的博客

这个是线段树or树状数组裸题树状数组 (刚学的O(∩_∩)O嗯!)//歪鸡劈 //don't copy //or you'll 滚蛋 //￥￥￥ #include<iostream> #include<cstdio> #include<cstdlib> #include<cmath> #include<algorithm> #include<cstring> #include<vector> #in

Poj3241 Object ClusteringPosition： http://poj.org/problem?id=3241 ListPoj3241 Object Clustering List Description Knowledge Solution Notice Code 感谢Description 大意：求曼哈顿距离最小生成树上第k大（第n-k小）的边。 Knowledge 参考