摘要：http://sxnuwhui.blog.163.com/blog/static/13706837320125494648469/小白书132页，我没弄明白try_to_insert（）函数。 历届试题 九宫重排 时间限制：1.0s 内存限制：256.0MB问题描述 如下面第一个图的九宫格中... 阅读全文

摘要：Problem DescriptionA friend of you is doing research on the Traveling Knight Problem (TKP) where you are to find the shortest closed tour of knight moves that visits each square of a given set of n squares on a chessboard exactly once. He thinks that the most difficult part of the problem is determi 阅读全文

摘要：此题可以做为三维深搜模板题。。胜利大逃亡Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 21776Accepted Submission(s): 8547 Problem DescriptionIgnatius被魔王抓走了,有一天魔王出差去了,这可是Ignatius逃亡的好机会.魔王住在一个城堡里,城堡是一个A*B*C的立方体,可以被表示成A个B*C的矩阵,刚开始Ignatius被关在(0,0,0)的位置,离开城堡的门在(A-1,B-1,C- 阅读全文

摘要：这道题还解决出，问题是数组装的路径是所有的路径，而不是那个最短路径，但是最短时间算对了，怎么样把数组装成那个最短的路径，是我一直要解决的问题，求大神帮我，or等我再有水平了，重新解决这个问题。。。。。 Ignatius and the Princess ITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 9911Accepted Submission(s): 2960 Special JudgeProblem DescriptionThe Pr 阅读全文

摘要：广搜的灵活应用题： 非常可乐Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3633Accepted Submission(s): 1514 Problem Description大家一定觉的运动以后喝可乐是一件很惬意的事情，但是seeyou却不这么认为。因为每次当seeyou买了可乐以后，阿牛就要求和seeyou一起分享这一瓶可乐，而且一定要喝的和seeyou一样多。但seeyou的手中只有两个杯子，它们的容量分别是N 毫升和M 毫升 可乐 阅读全文

摘要：Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 2664Accepted Submission(s): 1794 Problem DescriptionYou're in space. You want to get home. There are asteroids. You don't want to hit them. InputInput to this problem will consist of a (non-e 阅读全文

摘要：此题需要时间更少，控制时间很要，这个题目要多多看， Ignatius and the Princess ITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 9910Accepted Submission(s): 2959 Special JudgeProblem DescriptionThe Princess has been abducted by the BEelzebub feng5166, our hero Ignatius has t 阅读全文