Fitz~ - 博客园

2018年5月23日

摘要： Description Given a connected undirected graph, tell if its minimum spanning tree is unique. Definition 1 (Spanning Tree): Consider a connected, undir 阅读全文

posted @ 2018-05-23 22:30 Fitz~ 阅读(174) 评论(0) 推荐(0)

Extra Judicial Operation

摘要： Description The Suitably Protected Programming Contest (SPPC) is a multi-site contest in which contestants compete at specified sites, which are linke 阅读全文

posted @ 2018-05-23 19:01 Fitz~ 阅读(143) 评论(0) 推荐(0)

2018年5月22日

poj-3522 最小生成树

摘要： Description Given an undirected weighted graph G, you should find one of spanning trees specified as follows. The graph G is an ordered pair (V, E), w 阅读全文

posted @ 2018-05-22 21:43 Fitz~ 阅读(247) 评论(0) 推荐(0)

poj~1904

摘要： Description Once upon a time there lived a king and he had N sons. And there were N beautiful girls in the kingdom and the king knew about each of his 阅读全文

posted @ 2018-05-22 20:07 Fitz~ 阅读(155) 评论(0) 推荐(0)

poj~1236 Network of Schools 强连通入门题

摘要：一些学校连接到计算机网络。这些学校之间已经达成了协议：每所学校都有一份分发软件的学校名单（“接收学校”）。请注意，如果B在学校A的分发名单中，则A不一定出现在学校B的名单中您需要编写一个计划，计算必须接收新软件副本的最少学校数量，以便软件根据协议（子任务A）到达网络中的所有学校。作为进一步的任阅读全文

posted @ 2018-05-22 17:29 Fitz~ 阅读(417) 评论(0) 推荐(0)

poj 2186 强连通入门题目

摘要：每头牛的梦想就是成为牛群中最受欢迎的牛。在一群N（1 <= N <= 10,000）母牛中，你可以得到M（1 <= M <= 50,000）有序的形式对（A，B），告诉你母牛A认为母牛 B很受欢迎。由于流行是传递性的，如果A认为B很受欢迎，B认为C受欢迎，那么A也会认为C是流行的，即使这不是输阅读全文

posted @ 2018-05-22 16:17 Fitz~ 阅读(179) 评论(0) 推荐(0)

C. Liebig's Barrels

摘要： You have m = n·k wooden staves. The i-th stave has length ai. You have to assemble nbarrels consisting of k staves each, you can use any k staves to c 阅读全文

posted @ 2018-05-22 12:17 Fitz~ 阅读(478) 评论(0) 推荐(0)

2018年5月20日

poj 1696 极角排序求最长逆时针螺旋线

摘要： Space Ant Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 4970 Accepted: 3100 Description The most exciting space discovery occurred at the 阅读全文

posted @ 2018-05-20 23:37 Fitz~ 阅读(173) 评论(0) 推荐(0)

2101: Bake Off

摘要： Description Davy decided to start a weekend market stall where he sells his famous cakes. For the first market stall, Davy decided to bake n cakes. Ea 阅读全文

posted @ 2018-05-20 22:56 Fitz~ 阅读(206) 评论(0) 推荐(0)

2018年5月19日

poj~1556 The Doors 计算几何+最短路

摘要： Description You are to find the length of the shortest path through a chamber containing obstructing walls. The chamber will always have sides at x = 阅读全文

posted @ 2018-05-19 22:48 Fitz~ 阅读(517) 评论(0) 推荐(1)

Fitz

慢慢来生活总会好起来的！！！

Fitz

公告