随笔档案「2017年10月」 - 渡……

POJ 2449 Remmarguts' Date (K短路 A*算法）

摘要：" 题目链接 " Description "Good man never makes girls wait or breaks an appointment!" said the mandarin duck father. Softly touching his little ducks' head 阅读全文

posted @ 2017-10-31 18:13 渡…… 阅读(248) 评论(0) 推荐(0)

HDU 5984 Pocky ( 2016 CCPC 青岛 C)

摘要：" 题目链接 " Problem Description Let’s talking about something of eating a pocky. Here is a Decorer Pocky, with colorful decorative stripes in the coating 阅读全文

posted @ 2017-10-28 19:08 渡…… 阅读(1501) 评论(1) 推荐(0)

POJ 1986 Distance Queries （Tarjan算法求最近公共祖先）

摘要：" 题目链接 " Description Farmer John's cows refused to run in his marathon since he chose a path much too long for their leisurely lifestyle. He therefore 阅读全文

posted @ 2017-10-28 18:46 渡…… 阅读(169) 评论(0) 推荐(0)

POJ 3164 Command Network （最小树形图朱刘算法）

摘要：" 题目链接 " Description After a long lasting war on words, a war on arms finally breaks out between littleken’s and KnuthOcean’s kingdoms. A sudden and v 阅读全文

posted @ 2017-10-25 20:52 渡…… 阅读(228) 评论(0) 推荐(0)

POJ 3255 Roadblocks (次短路 SPFA )

摘要：" 题目链接 " Description Bessie has moved to a small farm and sometimes enjoys returning to visit one of her best friends. She does not want to get to her 阅读全文

posted @ 2017-10-25 11:24 渡…… 阅读(314) 评论(0) 推荐(0)

HAOI 2005 路由选择问题（最短路+次短路）

摘要：问题描述 X城有一个含有N个节点的通信网络，在通信中，我们往往关心信息从一个节点I传输到节点J的最短路径。遗憾的是，由于种种原因，线路中总有一些节点会出故障，因此在传输中要避开故障节点。任务一：在己知故障节点的情况下，求避开这些故障节点，从节点I到节点J的最短路径S0。任务二：在不考虑故障节点的阅读全文

posted @ 2017-10-24 19:54 渡…… 阅读(292) 评论(0) 推荐(0)

URAL 1416 Confidential （最小生成树+次小生成树）

摘要：Description Zaphod Beeblebrox — President of the Imperial Galactic Government. And by chance he is an owner of enterprises that trade in secondhand pe 阅读全文

posted @ 2017-10-24 09:52 渡…… 阅读(292) 评论(0) 推荐(0)

POJ 1679 The Unique MST (次小生成树判断最小生成树是否唯一)

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

posted @ 2017-10-23 19:02 渡…… 阅读(295) 评论(0) 推荐(0)

POJ 2485 Highways（最小生成树）

摘要：" 题目链接 " Description The islandnation of Flatopia is perfectly flat. Unfortunately, Flatopia has no publichighways. So the traffic is difficult in Fla 阅读全文

posted @ 2017-10-22 12:15 渡…… 阅读(178) 评论(0) 推荐(0)

POJ 1240 Pre-Post-erous! && East Central North America 2002 (由前序后序遍历序列推出M叉树的种类)

摘要：" 题目链接 " 问题描述 : We are all familiar with pre order, in order and post order traversals of binary trees. A common problem in data structure classes is 阅读全文

posted @ 2017-10-22 10:10 渡…… 阅读(182) 评论(0) 推荐(0)

POJ 2438 Children’s Dining (哈密顿图模板题之巧妙建反图 )

摘要：" 题目链接 " Description Usually children in kindergarten like to quarrel with each other. This situation annoys the child care women. For instant, when d 阅读全文

posted @ 2017-10-20 18:39 渡…… 阅读(213) 评论(0) 推荐(0)

POJ 2230 Watchcow && USACO Watchcow 2005 January Silver (欧拉回路)

摘要：Description Bessie's been appointed the new watch cow for the farm. Every night, it's her job to walk across the farm and make sure that no evildoers 阅读全文

posted @ 2017-10-20 14:34 渡…… 阅读(216) 评论(0) 推荐(0)

POJ 1128 Frame Stacking (拓扑排序)

摘要：" 题目链接 " Description Consider the following 5 picture frames placed on an 9 x 8 array. ........ ........ ........ ........ .CCC.... EEEEEE.. ........ 阅读全文

posted @ 2017-10-20 12:10 渡…… 阅读(180) 评论(0) 推荐(0)

HDU 1074 Doing Homework (dp+状态压缩)

摘要：" 题目链接 " Problem Description Ignatius has just come back school from the 30th ACM/ICPC. Now he has a lot of homework to do. Every teacher gives him a 阅读全文

posted @ 2017-10-17 19:49 渡…… 阅读(131) 评论(0) 推荐(0)

HDU 3790 最短路径问题（最短路）

摘要：" 题目链接 " Problem Description 给你n个点，m条无向边，每条边都有长度d和花费p，给你起点s终点t，要求输出起点到终点的最短距离及其花费，如果最短距离有多条路线，则输出花费最少的。 Input 输入n,m，点的编号是1~n,然后是m行，每行4个数 a,b,d,p，表示a和b 阅读全文

posted @ 2017-10-15 18:11 渡…… 阅读(230) 评论(0) 推荐(0)

HDU 1535 Invitation Cards (最短路)

摘要：" 题目链接 " Problem Description In the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware of this 阅读全文

posted @ 2017-10-15 17:52 渡…… 阅读(156) 评论(0) 推荐(0)

HDU 2722 Here We Go(relians) Again (最短路)

摘要：" 题目链接 " Problem Description The Gorelians are a warlike race that travel the universe conquering new worlds as a form of recreation. Given their viol 阅读全文

posted @ 2017-10-15 17:37 渡…… 阅读(209) 评论(0) 推荐(0)

HDU 1427 速算24点（深搜）

摘要：" 题目链接 " Problem Description 速算24点相信绝大多数人都玩过。就是随机给你四张牌，包括A(1),2,3,4,5,6,7,8,9,10,J(11),Q(12),K(13)。要求只用'+',' ',' ','/'运算符以及括号改变运算顺序，使得最终运算结果为24(每个数必须且阅读全文

posted @ 2017-10-15 16:30 渡…… 阅读(1097) 评论(0) 推荐(0)

HDU 1073 Online Judge （字符串处理）

摘要：" 题目链接 " Problem Description Ignatius is building an Online Judge, now he has worked out all the problems except the Judge System. The system has to r 阅读全文

posted @ 2017-10-15 15:33 渡…… 阅读(180) 评论(0) 推荐(0)

POJ 1350 Cabric Number Problem （模拟）

摘要：" 题目链接 " Description If we input a number formed by 4 digits and these digits are not all of one same value, then it obeys the following law. Let us o 阅读全文

posted @ 2017-10-15 15:15 渡…… 阅读(138) 评论(0) 推荐(0)