随笔分类 -  图论--搜索

上一页 1 2
搜索问题
2015暑假多校联合---Friends（dfs枚举）
摘要：原题链接 Problem Description There are n people and m pairs of friends. For every pair of friends, they can choose to become online friends (communicating 阅读全文
posted @ 2016-08-27 20:53 茶飘香~ 阅读(154) 评论(0) 推荐(0)
2016暑假多校联合---Windows 10
摘要：2016暑假多校联合 Windows 10（HDU：5802） Problem Description Long long ago, there was an old monk living on the top of a mountain. Recently, our old monk found 阅读全文
posted @ 2016-08-07 12:50 茶飘香~ 阅读(207) 评论(0) 推荐(0)
广搜（棋）
摘要：题目网址：http://acm.uestc.edu.cn/#/problem/show/1221Ancient GoTime Limit: 3000/1000MS (Java/Others) Memory Limit: 65535/65535KB (Java/Others)SubmitStatus... 阅读全文
posted @ 2015-12-07 18:51 茶飘香~ 阅读(197) 评论(0) 推荐(0)
深度搜索（2）
摘要：DescriptionThe 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 dog... 阅读全文
posted @ 2015-08-06 11:39 茶飘香~ 阅读(172) 评论(0) 推荐(0)
广度搜索（2）
摘要：DescriptionThe GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular... 阅读全文
posted @ 2015-08-05 20:17 茶飘香~ 阅读(145) 评论(0) 推荐(0)
广度搜索
摘要：DescriptionThere 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... 阅读全文
posted @ 2015-08-05 18:35 茶飘香~ 阅读(246) 评论(0) 推荐(0)

上一页 1 2