随笔分类 - 树 - DFS序

摘要：#include#include#includeusing namespace std;const int N=250000+6;int C[N0)tmp+=C[t],t-=lowbit(t); return tmp;}void dfs(int u,i... 阅读全文

posted @ 2018-08-23 20:03 EM-LGH 阅读(212) 评论(0) 推荐(0)

EM-LGH