村雨sup - 博客园

2019年5月5日

摘要： 1004 Counting Leaves (30 分) 1004 Counting Leaves (30 分) 1004 Counting Leaves (30 分) A family hierarchy is usually presented by a pedigree tree. Your j 阅读全文

posted @ 2019-05-05 09:22 村雨sup 阅读(138) 评论(0) 推荐(0)

2019年5月4日

PAT 1122 Hamiltonian Cycle

摘要： 1122 Hamiltonian Cycle (25 分) 1122 Hamiltonian Cycle (25 分) 1122 Hamiltonian Cycle (25 分) The "Hamilton cycle problem" is to find a simple cycle that 阅读全文

posted @ 2019-05-04 16:00 村雨sup 阅读(142) 评论(0) 推荐(0)

PAT 1126 Eulerian Path

摘要： 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 阅读全文

posted @ 2019-05-04 13:32 村雨sup 阅读(90) 评论(0) 推荐(0)

PAT 1142 Maximal Clique

摘要： 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 阅读全文

posted @ 2019-05-04 09:30 村雨sup 阅读(124) 评论(0) 推荐(0)

2019年5月3日

PAT 1076 Forwards on Weibo

摘要： 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 阅读全文

posted @ 2019-05-03 14:31 村雨sup 阅读(108) 评论(0) 推荐(0)

PAT 1021 Deepest Root

摘要： 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 阅读全文

posted @ 2019-05-03 10:39 村雨sup 阅读(156) 评论(0) 推荐(0)

2019年5月2日

PAT 1030 Travel Plan*

摘要： 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 阅读全文

posted @ 2019-05-02 14:40 村雨sup 阅读(195) 评论(0) 推荐(0)

diji模板

摘要：初始化： diji+dfs模板 ——求相同路径的条数把pre[i]中有数的连城就好了8 https://www.liuchuo.net/archives/tag/dijkstra 阅读全文

posted @ 2019-05-02 13:26 村雨sup 阅读(262) 评论(0) 推荐(0)

PAT 1020 Tree Traversals

摘要： 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 阅读全文

posted @ 2019-05-02 08:35 村雨sup 阅读(132) 评论(0) 推荐(0)

2019年5月1日

PAT 1108 Finding Average

摘要： 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 阅读全文

posted @ 2019-05-01 14:11 村雨sup 阅读(122) 评论(0) 推荐(0)