算法设计-搜索技术
文章平均质量分 86
twobqn123
这个作者很懒,什么都没留下…
展开
-
POJ1564(DFS构造法) Sum It Up
Sum It UpTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 5378 Accepted: 2714DescriptionGiven a specified total t and a list of n integers, find all distin原创 2013-07-21 17:55:47 · 462 阅读 · 0 评论 -
poj 1130 Alien Security (dfs+bfs<反向最短路>)
Alien SecurityTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 2646 Accepted: 974DescriptionYou are in charge of security at a top-secret government resear原创 2013-12-23 21:22:47 · 816 阅读 · 0 评论 -
poj2197||zoj2406 Jill's Tour Paths(回溯+优先队列)
Jill's Tour PathsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1361 Accepted: 407DescriptionEvery year, Jill takes a bicycle tour between two villages.原创 2013-12-23 00:28:15 · 708 阅读 · 0 评论 -
ZOJ 2110(HDU 1010) Tempter of the Bone(经典剪枝-奇偶剪枝)
Tempter of the BoneTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 33445 Accepted Submission(s): 9015Problem DescriptionThe dog原创 2013-12-01 19:14:09 · 587 阅读 · 0 评论 -
ZOJ 3675 Trim the Nails(bfs+状态压缩搜索)
Trim the NailsTime Limit: 2 Seconds Memory Limit: 65536 KB Robert is clipping his fingernails. But the nail clipper is old and the edge of the nail clipper is potholed.The nail clippe原创 2013-12-21 15:31:58 · 574 阅读 · 0 评论 -
poj1562 Oil Deposits(dfs求联通分量)
Oil DepositsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 11399 Accepted: 6199DescriptionThe GeoSurvComp geologic survey company is responsible for dete原创 2013-12-06 00:52:45 · 896 阅读 · 0 评论 -
poj1178 Camelot(floyd+枚举)
CamelotTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 2558 Accepted: 1190DescriptionCenturies ago, King Arthur and the Knights of the Round Table used to原创 2013-12-11 08:33:18 · 626 阅读 · 0 评论 -
poj2225Asteroids!(三维BFS)
Asteroids!Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2875 Accepted: 1090DescriptionYou're in space.You want to get home.There are asteroids.You原创 2013-12-03 23:02:18 · 995 阅读 · 0 评论 -
poj1979 Red and Black(dfs判断联通分量)
Red and BlackTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 19925 Accepted: 10677DescriptionThere is a rectangular room, covered with square tiles. Each原创 2013-12-08 00:17:22 · 803 阅读 · 0 评论 -
poj3083 非常好 的入门级dfs+bfs
poj3083 Children of the Candy CornTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8505 Accepted: 3728DescriptionThe cornfield maze is a popular Halloween原创 2013-11-30 22:26:02 · 839 阅读 · 0 评论 -
poj 1129 DFS+四色问题 Channel Allocation
Channel AllocationTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 10773 Accepted: 5523DescriptionWhen a radio station is broadcasting over a very large ar原创 2013-07-22 21:08:53 · 555 阅读 · 0 评论 -
DFS_ZOJ1002
Fire NetTime Limit: 2 Seconds Memory Limit: 65536 KB Suppose that we have a square city with straight streets. A map of a city is a squareboard with n rows and n columns, each represent原创 2013-07-22 01:46:43 · 521 阅读 · 0 评论 -
poj3984(DFS写法) 迷宫路径问题
迷宫问题Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6113 Accepted: 3540Description定义一个二维数组:int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0,原创 2013-07-21 16:43:47 · 942 阅读 · 1 评论 -
poj3984(BFS)迷宫路径
迷宫问题Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6112 Accepted: 3539Description定义一个二维数组:int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0,原创 2013-07-21 16:18:44 · 585 阅读 · 0 评论 -
FZU 2150 Fire Game(枚举两个源点的bfs)
K - Fire Game题目链接题目大意:给定一个图,‘.’表示空地,'#'表示草地。选择2块草地为放火点,火势每秒向上下左右蔓延。开始时间为0,问所有草地被燃烧的最少时间。如果不能,则输出-1。思路;枚举两个块草地u,v。然后以这两个点为原点进行bfs。dist[i][j]表示草地i到草地j的最短距离。dist[][]初始化为Inf。那么每次枚举的两块草地u,v后,原创 2014-01-24 00:54:55 · 568 阅读 · 0 评论