摘要: 题目链接:http://poj.org/problem?id=1986Farmer John's cows refused to run in his marathon since he chose a path much too long for their leisurely lifestyle... 阅读全文
posted @ 2015-02-28 22:50 huangxf 阅读(170) 评论(0) 推荐(0) 编辑
摘要: 题目链接:http://poj.org/problem?id=1470Write a program that takes as input a rooted tree and a list of pairs of vertices. For each pair (u,v) the program ... 阅读全文
posted @ 2015-02-28 15:56 huangxf 阅读(136) 评论(0) 推荐(0) 编辑
摘要: 题目链接:http://poj.org/problem?id=1330A rooted tree is a well-known data structure in computer science and engineering. An example is shown below:In the ... 阅读全文
posted @ 2015-02-28 13:33 huangxf 阅读(141) 评论(0) 推荐(0) 编辑
摘要: 题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=3046In ZJNU, there is a well-known prairie. And it attracts pleasant sheep and his companions to have a... 阅读全文
posted @ 2015-02-26 15:15 huangxf 阅读(781) 评论(0) 推荐(0) 编辑
摘要: 题目链接:http://poj.org/problem?id=3281Cows are such finicky eaters. Each cow has a preference for certain foods and drinks, and she will consume no other... 阅读全文
posted @ 2015-02-25 17:30 huangxf 阅读(534) 评论(0) 推荐(0) 编辑
摘要: 题目链接:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=1760Given a weighted directed graph, we define the shortest path as the path who has t... 阅读全文
posted @ 2015-02-25 16:05 huangxf 阅读(726) 评论(0) 推荐(0) 编辑
摘要: 题目链接:http://poj.org/problem?id=1422Consider a town where all the streets are one-way and each street leads from one intersection to another. It is als... 阅读全文
posted @ 2015-02-22 12:56 huangxf 阅读(285) 评论(0) 推荐(0) 编辑
摘要: 题目链接:http://poj.org/problem?id=1325As we all know, machine scheduling is a very classical problem in computer science and has been studied for a very ... 阅读全文
posted @ 2015-02-22 12:32 huangxf 阅读(209) 评论(0) 推荐(0) 编辑
摘要: 寒假的第二周,弥补了一下图论算法。在这里做一下总结,主要针对近期学到的一些建模技巧,同时也非常感谢有朋友能够给出图论算法相关的精彩讲解或者知识链接。算法总结:欧拉回路问题:判断图是否存在欧拉回路或者欧拉通路,输出一条欧拉回路。学习Fleury算法输出一条欧拉回路。 1 /* G是连通无向图,则称经过... 阅读全文
posted @ 2015-02-09 20:14 huangxf 阅读(2022) 评论(0) 推荐(2) 编辑
摘要: POJ图论分类【转】 一个很不错的图论分类,非常感谢原版的作者!!!在这里分享给大家,爱好图论的ACMer不寂寞了。。。 (很抱歉没有找到此题集整理的原创作者,感谢知情的朋友给个原创链接)POJ:http://poj.org/1062* 昂贵的聘礼 枚举等级限制+dijkstra1087* A ... 阅读全文
posted @ 2015-02-07 17:26 huangxf 阅读(677) 评论(1) 推荐(1) 编辑
摘要: 题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=3157You’ve just built a circuit board for your new robot, and now you need to power it. Your robot circ... 阅读全文
posted @ 2015-02-03 18:52 huangxf 阅读(416) 评论(0) 推荐(0) 编辑
摘要: 题目链接:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=1314The terrorist group leaded by a well known international terrorist Ben Bladen is b... 阅读全文
posted @ 2015-02-02 15:36 huangxf 阅读(329) 评论(0) 推荐(0) 编辑
摘要: 题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=3572Our geometry princess XMM has stoped her study in computational geometry to concentrate on her newl... 阅读全文
posted @ 2015-02-01 23:36 huangxf 阅读(333) 评论(0) 推荐(0) 编辑
摘要: 题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=3549Network flow is a well-known difficult problem for ACMers. Given a graph, your task is to find out ... 阅读全文
posted @ 2015-02-01 17:19 huangxf 阅读(385) 评论(0) 推荐(0) 编辑
摘要: 题目链接:http://poj.org/problem?id=1386Some of the secret doors contain a very interesting word puzzle. The team of archaeologists has to solve it to open... 阅读全文
posted @ 2015-02-01 12:05 huangxf 阅读(184) 评论(0) 推荐(0) 编辑