搜索
hncu__lz
既然坚持了这么久,就要坚持到最后~
展开
-
*hdu1078(记忆化搜索)
#include #include #include using namespace std; int n,k,dp[105][105],a[105][105]; int to[4][2] = {1,0,-1,0,0,1,0,-1}; int check(int x,int y) { if(x1 || y1 || x>n || y>n)原创 2016-03-17 20:32:23 · 472 阅读 · 0 评论 -
Tempter of the Bone(搜索)
Problem Description The doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, and the doggie could feel the ground sinking. He rea原创 2016-07-04 19:30:06 · 193 阅读 · 0 评论 -
Prime Ring Problem(DFS)
Problem Description A ring is compose of n circles as shown in diagram. Put natural number 1, 2, …, n into each circle separately, and the sum of numbers in two adjacent circles should be a prime.Note原创 2016-07-04 19:34:58 · 213 阅读 · 0 评论 -
优先队列的使用
队列的特点是先进先出。通常都把队列比喻成排队买东西,大家都很守秩序,先排队的人就先买东西。但是优先队列有所不同,它不遵循先进先出的规则,而是根据队列中元素的优先权,优先权最大的先被取出。通常把优先队列比喻成现实生活中的打印。一个打印店里有很多打印机,每台机器的性能不一样,有的打印机打印很快,有的打印机打印速度很慢。当这些打印机陆陆续续打印完自己的任务时进入排队等候状态。如果我这个时候要打印一份文件,原创 2016-07-07 11:30:41 · 353 阅读 · 0 评论 -
Prime Ring Problem (dfs)
Problem Description A ring is compose of n circles as shown in diagram. Put natural number 1, 2, …, n into each circle separately, and the sum of numbers in two adjacent circles should be a prime.Note原创 2016-07-21 10:36:20 · 186 阅读 · 0 评论 -
Oil Deposits (dfs)
Problem Description The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creates a原创 2016-07-21 10:45:02 · 165 阅读 · 0 评论 -
hdu1195
Problem Description Now an emergent task for you is to open a password lock. The password is consisted of four digits. Each digit is numbered from 1 to 9. Each time, you can add or minus 1 to any di原创 2016-07-21 11:42:43 · 414 阅读 · 0 评论 -
poj 2531 Network Saboteur(深搜)
DescriptionA university network is composed of N computers. System administrators gathered information on the traffic between nodes, and carefully divided the network into two subnetworks in order to m原创 2016-08-08 03:55:52 · 316 阅读 · 5 评论 -
hdu 3652 B-number (数位DP)
Problem DescriptionA wqb-number, or B-number for short, is a non-negative integer whose decimal form contains the sub- string "13" and can be divided by 13. For example, 130 and 2613 are wqb-numbers原创 2016-09-17 18:57:13 · 240 阅读 · 0 评论 -
hdu1175 连连看 (BFS+优先队列)
Problem Description “连连看”相信很多人都玩过。没玩过也没关系,下面我给大家介绍一下游戏规则:在一个棋盘中,放了很多的棋子。如果某两个相同的棋子,可以通过一条线连起来(这条线不能经过其它棋子),而且线的转折次数不超过两次,那么这两个棋子就可以在棋盘上消去。不好意思,由于我以前没有玩过连连看,咨询了同学的意见,连线不能从外面绕过去的,但事实上这是错的。现在已经酿成大祸,就只能将错原创 2016-07-24 11:03:43 · 306 阅读 · 0 评论 -
hdu 2717 Catch That Cow (BFS)
Problem Description Farmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 ≤ N ≤ 100,000) on a number line and the cow is at a po原创 2016-07-23 20:55:28 · 179 阅读 · 0 评论 -
hdu A计划 (BFS)
Problem Description 可怜的公主在一次次被魔王掳走一次次被骑士们救回来之后,而今,不幸的她再一次面临生命的考验。魔王已经发出消息说将在T时刻吃掉公主,因为他听信谣言说吃公主的肉也能长生不老。年迈的国王正是心急如焚,告招天下勇士来拯救公主。不过公主早已习以为常,她深信智勇的骑士LJ肯定能将她救出。 现据密探所报,公主被关在一个两层的迷宫里,迷宫的入口是S(0,0,0),公主的位置原创 2016-07-22 17:33:15 · 427 阅读 · 0 评论 -
hdu2612 Find a way( bfs )
Problem Description Last night, little erriyue had a horrible nightmare. He dreamed that he and his girl friend were trapped in a big maze separately. More terribly, there are two ghosts in the maze.原创 2016-07-22 18:17:37 · 246 阅读 · 0 评论 -
hdu Sum It Up (DFS)
Problem Description Given a specified total t and a list of n integers, find all distinct sums using numbers from the list that add up to t. For example, if t=4, n=6, and the list is [4,3,2,2,1,1], th原创 2016-07-22 21:44:08 · 249 阅读 · 0 评论 -
hdu3085Nightmare Ⅱ(双向广搜)
Problem Description Last night, little erriyue had a horrible nightmare. He dreamed that he and his girl friend were trapped in a big maze separately. More terribly, there are two ghosts in the maze.原创 2016-07-23 02:07:29 · 294 阅读 · 0 评论 -
hdu1885Key Task (BFS+状态压缩)
Problem Description The Czech Technical University is rather old — you already know that it celebrates 300 years of its existence in 2007. Some of the university buildings are old as well. And the nav原创 2016-07-23 16:32:36 · 211 阅读 · 0 评论 -
hduRed and Black (bfs)
Problem Description There is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one of four adjacen原创 2016-07-23 18:17:14 · 167 阅读 · 0 评论 -
hdu 变形课(DFS)
Problem Description 呃……变形课上Harry碰到了一点小麻烦,因为他并不像Hermione那样能够记住所有的咒语而随意的将一个棒球变成刺猬什么的,但是他发现了变形咒语的一个统一规律:如果咒语是以a开头b结尾的一个单词,那么它的作用就恰好是使A物体变成B物体. Harry已经将他所会的所有咒语都列成了一个表,他想让你帮忙计算一下他是否能完成老师的作业,将一个B(ball)变成原创 2016-07-23 18:18:19 · 386 阅读 · 0 评论 -
hdu1015 Safecracker (DFS)
Problem Description === Op tech briefing, 2002/11/02 06:42 CST === “The item is locked in a Klein safe behind a painting in the second-floor library. Klein safes are extremely rare; most of them, al原创 2016-07-23 20:35:03 · 234 阅读 · 0 评论 -
hdu 1026 Ignatius and the Princess I (带路径的搜索)
Problem DescriptionThe Princess has been abducted by the BEelzebub feng5166, our hero Ignatius has to rescue our pretty Princess. Now he gets into feng5166's castle. The castle is a large labyrint原创 2017-03-15 20:23:48 · 377 阅读 · 0 评论