摘要:
1004 Counting Leaves (30 分) 1004 Counting Leaves (30 分) 1004 Counting Leaves (30 分) A family hierarchy is usually presented by a pedigree tree. Your j 阅读全文
摘要:
1122 Hamiltonian Cycle (25 分) 1122 Hamiltonian Cycle (25 分) 1122 Hamiltonian Cycle (25 分) The "Hamilton cycle problem" is to find a simple cycle that 阅读全文
摘要:
1126 Eulerian Path (25 分) 1126 Eulerian Path (25 分) 1126 Eulerian Path (25 分) In graph theory, an Eulerian path is a path in a graph which visits ever 阅读全文
摘要:
1142 Maximal Clique (25 分) 1142 Maximal Clique (25 分) 1142 Maximal Clique (25 分) A clique is a subset of vertices of an undirected graph such that eve 阅读全文
摘要:
1076 Forwards on Weibo (30 分) 1076 Forwards on Weibo (30 分) 1076 Forwards on Weibo (30 分) Weibo is known as the Chinese version of Twitter. One user o 阅读全文
摘要:
1021 Deepest Root (25 分) 1021 Deepest Root (25 分) 1021 Deepest Root (25 分) A graph which is connected and acyclic can be considered a tree. The height 阅读全文
摘要:
1030 Travel Plan (30 分) 1030 Travel Plan (30 分) 1030 Travel Plan (30 分) A traveler's map gives the distances between cities along the highways, togeth 阅读全文
摘要:
初始化: diji+dfs模板 ——求相同路径的条数把pre[i]中有数的连城就好了8 https://www.liuchuo.net/archives/tag/dijkstra 阅读全文
摘要:
1020 Tree Traversals (25 分) 1020 Tree Traversals (25 分) 1020 Tree Traversals (25 分) Suppose that all the keys in a binary tree are distinct positive i 阅读全文
摘要:
1108 Finding Average (20 分) 1108 Finding Average (20 分) 1108 Finding Average (20 分) The basic task is simple: given N real numbers, you are supposed t 阅读全文