- 博客(2)
- 收藏
- 关注
RSS订阅原创 AtCoder Beginner Contest 070 Transit Tree Path
You are given a tree with N vertices. Here, a tree is a kind of graph, and more specifically, a connected undirected graph with N−1 edges, where N is the number of its vertices. The i-th edge (1≤i
2017-08-14 09:46:41
265
转载 划分树
对百度csdn划分树代码的自己的注释 #include #include #include #include #include using namespace std; int tree[20][100],tolf[20][100],sortt[100]; int maxlevel; void build(int level,int L,int R) { maxlevel=lev
2017-08-02 18:29:29
162
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人