poj 3009 Curling 2.0(dfs)
摘要:Curling 2.0Time Limit: 1000MSMemory Limit: 65536KTotal Submissions: 11353Accepted: 4804DescriptionOn Planet MM-21, after their Olympic games this year...
阅读全文
posted @
2014-07-31 19:26
细雨微光
阅读(191)
推荐(0) 编辑
poj 3083 Children of the Candy Corn
摘要:Children of the Candy CornTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 9528Accepted: 4126DescriptionThe cornfield maze is a popular Hallow...
阅读全文
posted @
2014-07-30 20:23
细雨微光
阅读(1047)
推荐(0) 编辑
HDOJ 4884 & BestCoder#2 1002
摘要:TIANKENG’s rice shopTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 212Accepted Submission(s): 9Pr...
阅读全文
posted @
2014-07-29 16:08
细雨微光
阅读(302)
推荐(0) 编辑
hdoj 1288 Hat's Tea
摘要:Hat's TeaTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1139Accepted Submission(s): 238Problem De...
阅读全文
posted @
2014-07-10 18:15
细雨微光
阅读(504)
推荐(0) 编辑
hdoj 1053 Entropy(用哈夫曼编码)优先队列
摘要:题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1053讲解: 题意:给定一个字符串,根据哈夫曼编码求出最短长度,并求出比值。 思路:就是哈夫曼编码。把单个字符出现次数作为权值。AC代码: 1 #include 2 #include 3 #inc...
阅读全文
posted @
2014-07-09 11:32
细雨微光
阅读(586)
推荐(0) 编辑
poj 3617 Best Cow Line (字符串反转贪心算法)
摘要:Best Cow LineTime Limit:1000MSMemory Limit:65536KTotal Submissions:9284Accepted:2826DescriptionFJ is about to take hisN(1 ≤N≤ 2,000) cows to the annua...
阅读全文
posted @
2014-07-08 21:57
细雨微光
阅读(931)
推荐(0) 编辑
三种博弈问题
摘要:三种博弈问题一)巴什博弈(Bash Game):只有一堆n个物品,两个人轮流从这堆物品中取物,规定每次至少取一个,最多取m个。最后取光者得胜。很容易想到当n%(m+1)0时,先取必胜,第一次先拿走n%(m+1),以后每个回合到保持两人拿走的物品总和为m+1即可。这个游戏还可以有一种变相的玩法:两个人...
阅读全文
posted @
2014-07-06 20:26
细雨微光
阅读(742)
推荐(0) 编辑