随笔分类 -  POJ

上一页 1 2 3 4 下一页
http://poj.org/
POJ 1062 昂贵的聘礼【经典的最短路问题】
摘要：原题链接：http://poj.org/problem?id=1062我的链接：http://acm.hust.edu.cn/vjudge/contest/view.action?cid=19651#problem/E昂贵的聘礼Time Limit:1000MSMemory Limit:10000KTotal Submissions:29628Accepted:8296Description年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了，于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给他。探险家拿不出这么多金币，便请求酋长降低要求。酋长说："嗯， 阅读全文
posted @ 2013-03-01 17:56 free斩 阅读(191) 评论(0) 推荐(0)
POJ 1847 Tram【最短路入门Dijkstra算法模板题目一】
摘要：原题链接：http://poj.org/problem?id=1847我的链接：http://acm.hust.edu.cn/vjudge/contest/view.action?cid=19651#problem/D最短路模板题。TramTime Limit:1000MSMemory Limit:30000KTotal Submissions:7960Accepted:2861DescriptionTram network in Zagreb consists of a number of intersections and rails connecting some of them. In 阅读全文
posted @ 2013-02-27 20:17 free斩 阅读(355) 评论(0) 推荐(0)
POJ 3041 Asteroids (匈牙利算法最小点覆盖)
摘要：原题链接：http://poj.org/problem?id=3041题目来源：http://acm.hust.edu.cn:8080/judge/contest/view.action?cid=16967#problem/E算法：匈牙利算法（二分匹配，求最小点覆盖数）AsteroidsTime Limit:1000MSMemory Limit:65536KTotal Submissions:10768Accepted:5823DescriptionBessie wants to navigate her spaceship through a dangerous asteroid field 阅读全文
posted @ 2012-11-23 01:13 free斩 阅读(594) 评论(0) 推荐(0)
POJ 3041 Asteroids 【匈牙利算法最小点覆盖】
摘要：原题链接：http://poj.org/problem?id=3041题目来源：http://acm.hust.edu.cn:8080/judge/contest/view.action?cid=16967#problem/E算法：匈牙利算法（二分匹配，求最小点覆盖数）AsteroidsTime Limit:1000MSMemory Limit:65536KTotal Submissions:10768Accepted:5823DescriptionBessie wants to navigate her spaceship through a dangerous asteroid field 阅读全文
posted @ 2012-11-23 01:13 free斩 阅读(255) 评论(0) 推荐(0)
POJ 1094 && ZOJ 1060 Sorting It All Out 【拓扑排序入门】
摘要：原题链接：http://poj.org/problem?id=1094同ZOJ 1060：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=1060Sorting It All OutTime Limit:1000MSMemory Limit:10000KTotal Submissions:21983Accepted:7574DescriptionAnascending sorted sequence of distinct values is one in which some form of aless-than op 阅读全文
posted @ 2012-11-20 20:06 free斩 阅读(215) 评论(0) 推荐(0)
POJ 1258 Agri-Net （最小生成树入门题目）
摘要：原题链接：http://poj.org/problem?id=1258周四上了节数据结构终于知道何为最小生成树，晚上回寝，遂得此题！Agri-NetTime Limit:1000MSMemory Limit:10000KTotal Submissions:29613Accepted:11750Description Farmer John has been elected mayor of his town! One of his campaign promises was to bring internet connectivity to all farms in the area. He 阅读全文
posted @ 2012-11-16 02:49 free斩 阅读(211) 评论(0) 推荐(0)
POJ 3278 Catch That Cow （bfs+队列）
摘要：原题链接：http://poj.org/problem?id=3278算法：bfs+队列+STL（C++）PS：bfs入门题目，好高兴啊，终于会用bfs了。Catch That CowTime Limit:2000MSMemory Limit:65536KTotal Submissions:32679Accepted:10060DescriptionFarmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a pointN(0 阅读全文
posted @ 2012-11-10 00:52 free斩 阅读(217) 评论(0) 推荐(0)
POJ 3278 Catch That Cow 【bfs+队列】
摘要：原题链接：http://poj.org/problem?id=3278算法：bfs+队列+STL（C++）PS：bfs入门题目，好高兴啊，终于会用bfs了。Catch That CowTime Limit:2000MSMemory Limit:65536KTotal Submissions:32679Accepted:10060DescriptionFarmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a pointN(0 阅读全文
posted @ 2012-11-10 00:52 free斩 阅读(213) 评论(0) 推荐(0)
POJ 1753 Flip Game（翻转棋盘+枚举+dfs）
摘要：方法：一、枚举（此处所用） 二、用二进制记录下标（尚未实现） 三、类比于玩魔方游戏（思路来自黄超，尚未实现）原题链接：http://poj.org/problem?id=1753Flip GameTime Limit:1000MSMemory Limit:65536KTotal Submissions:21024Accepted:9108DescriptionFlip game is played on a rectangular 4x4 field with two-sided pieces placed on each of its 16 squares. One side ... 阅读全文
posted @ 2012-11-02 19:35 free斩 阅读(595) 评论(0) 推荐(0)
POJ 1753 Flip Game【翻转棋盘+枚举+dfs】
摘要：方法：一、枚举（此处所用） 二、用二进制记录下标（尚未实现） 三、类比于玩魔方游戏（思路来自黄超，尚未实现）原题链接：http://poj.org/problem?id=1753Flip GameTime Limit:1000MSMemory Limit:65536KTotal Submissions:21024Accepted:9108DescriptionFlip game is played on a rectangular 4x4 field with two-sided pieces placed on each of its 16 squares. One side ... 阅读全文
posted @ 2012-11-02 19:35 free斩 阅读(256) 评论(0) 推荐(0)
POJ 2029 && ZOJ 1716 Get Many Persimmon Trees
摘要：枚举入门。原题链接：http://poj.org/problem?id=2029POJ http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=716ZOJGet Many Persimmon TreesTime Limit:1000MSMemory Limit:30000KTotal Submissions:2788Accepted:1808DescriptionSeiji Hayashi had been a professor of the Nisshinkan Samurai School in the dom... 阅读全文
posted @ 2012-10-28 15:27 free斩 阅读(230) 评论(0) 推荐(0)
POJ 2109 Power of Cryptography
摘要：不知道那里贪心了。。。学长说贪心。注意：数据类型范围，还是不太了解；原题链接：http://poj.org/problem?id=2109Power of CryptographyTime Limit:1000MSMemory Limit:30000KTotal Submissions:13983Accepted:7136DescriptionCurrent work in cryptography involves (among other things) large prime numbers and computing powers of numbers among these prim 阅读全文
posted @ 2012-09-18 20:48 free斩 阅读(301) 评论(0) 推荐(0)
POJ 1328 Radar Installation
摘要：雷达覆盖问题，贪心算法。题目来源：CSUST2012年8月暑假集训组队后第一场个人赛（貌似是8月7日）原题链接：http://poj.org/problem?id=1328Radar InstallationTime Limit:1000MSMemory Limit:10000KTotal Submissions:34841Accepted:7737DescriptionAssume the coasting is an infinite straight line. Land is in one side of coasting, sea in the other. Each small i 阅读全文
posted @ 2012-09-18 20:05 free斩 阅读(264) 评论(0) 推荐(0)
POJ 3219 Binomial Coefficients
摘要：思想深奥，代码操简单的数学问题。题目链接：http://poj.org/problem?id=3219CSUST 2012年暑假8月组队后个人赛第12场：http://acm.hust.edu.cn:8080/judge/contest/view.action?cid=11900#problem/DD -Binomial CoefficientsTime Limit:1000MSMemory Limit:131072KB64bit IO Format:%I64d & %I64uSubmitStatusPracticePOJ 3219DescriptionThe binomial coe 阅读全文
posted @ 2012-08-22 21:03 free斩 阅读(263) 评论(0) 推荐(0)
POJ 1840 Eqs
摘要：唉，我的入门“hash”题目链接：http://poj.org/problem?id=1840CSUST 2012年暑假8月组队后第十二次个人赛：http://acm.hust.edu.cn:8080/judge/contest/view.action?cid=11900#problem/BEqsTime Limit:5000MSMemory Limit:65536KTotal Submissions:8973Accepted:4446DescriptionConsider equations having the following form:a1x13+ a2x23+ a3x33+ a4x 阅读全文
posted @ 2012-08-22 16:35 free斩 阅读(186) 评论(0) 推荐(0)
POJ 1862 Stripies
摘要：题目链接：http://poj.org/problem?id=1862CSUST2012年8月19日暑假组队后第10次个人训练赛http://acm.hust.edu.cn:8080/judge/contest/view.action?cid=11732#problem/BPOJ1862StripiesTimeLimit:1000MSMemoryLimit:30000KTotalSubmissions:9477Accepted:4610DescriptionOurchemicalbiologistshaveinventedanewveryusefulformoflifecalledstripi 阅读全文
posted @ 2012-08-19 20:48 free斩 阅读(267) 评论(0) 推荐(0)
POJ 2063 Investment
摘要：快速链接：http://poj.org/problem?id=2063CSUST 2012年暑假8月组队后第八次个人赛：http://acm.hust.edu.cn:8080/judge/contest/view.action?cid=11473#problem/DInvestmentTime Limit:1000MSMemory Limit:30000KTotal Submissions:5370Accepted:1848DescriptionJohn never knew he had a grand-uncle, until he received the notary's le 阅读全文
posted @ 2012-08-15 14:06 free斩 阅读(267) 评论(0) 推荐(0)
POJ 3125 Printer Queue（打印队列）
摘要：题目链接： http://poj.org/problem?id=31252012年8月7日，暑假组队后个人训练赛第一场Printer QueueTime Limit:1000MSMemory Limit:65536KTotal Submissions:3082Accepted:1655DescriptionThe only printer in the computer science students' union is experiencing an extremely heavy workload. Sometimes there are a hundred jobs in th 阅读全文
posted @ 2012-08-14 16:47 free斩 阅读(549) 评论(0) 推荐(0)
POJ 1579 Function Run Fun
摘要：题目链接：http://poj.org/problem?id=15792012年暑假组队后第一场个人训练赛FunctionRunFunTimeLimit:1000MSMemoryLimit:10000KTotalSubmissions:13148Accepted:6836DescriptionWeallloverecursion!Don'twe?Considerathree-parameterrecursivefunctionw(a,b,c):ifa<=0orb<=0orc<=0,thenw(a,b,c)returns:1ifa>20orb>20orc&g 阅读全文
posted @ 2012-08-14 16:25 free斩 阅读(266) 评论(0) 推荐(0)
POJ 1573 && hdu 1035 Robot Motion（简单模拟）
摘要：题目链接：http://poj.org/problem?id=1573 http://acm.hdu.edu.cn/showproblem.php?pid=1035Robot MotionTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3893Accepted Submission(s): 1817Problem DescriptionA robot has been programmed to follow the instr... 阅读全文
posted @ 2012-08-14 16:10 free斩 阅读(191) 评论(0) 推荐(0)

上一页 1 2 3 4 下一页