摘要：
树上的路径统计问题。树的点分治。 Implementation c++ include using namespace std; const int N=1e5+5; int a[N]; vector g[N]; int size[N]; bool removed[N]; pair centroid 阅读全文
「以解决问题为乐」
真的喜欢么？真的喜欢就去做吧。
Lost Boy Calling 。。。。
... Many of these issues are best dealt with at the algorithmic level, rather than by "tweaking" the code.
This is an obscurity that catches the unwary.
原来我什么都不懂。