随笔分类 -  算法：搜索

1 2 下一页
poj 1724:ROADS（DFS + 剪枝）
摘要：ROADSTime Limit:1000MSMemory Limit:65536KTotal Submissions:10777Accepted:3961DescriptionN cities named with numbers 1 ... N are connected with one-way... 阅读全文
posted @ 2014-08-05 09:32 Freecode# 阅读(592) 评论(0) 推荐(0) 编辑
poj 3984:迷宫问题（广搜，入门题）
摘要：迷宫问题Time Limit:1000MSMemory Limit:65536KTotal Submissions:7635Accepted:4474Description定义一个二维数组：int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, ... 阅读全文
posted @ 2014-07-22 19:10 Freecode# 阅读(4280) 评论(2) 推荐(0) 编辑
poj 3278:Catch That Cow（简单一维广搜）
摘要：Catch That CowTime Limit:2000MSMemory Limit:65536KTotal Submissions:45648Accepted:14310DescriptionFarmer John has been informed of the location of a f... 阅读全文
posted @ 2014-07-22 11:37 Freecode# 阅读(333) 评论(0) 推荐(0) 编辑
hdu 1242:Rescue（BFS广搜 + 优先队列）
摘要：RescueTime Limit : 2000/1000ms (Java/Other)Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 14Accepted Submission(s) : 7Font:Times New Ro... 阅读全文
posted @ 2014-05-01 17:16 Freecode# 阅读(633) 评论(0) 推荐(0) 编辑
hdu 1240:Asteroids!（三维BFS搜索）
摘要：Asteroids!Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3159Accepted Submission(s): 2106Problem ... 阅读全文
posted @ 2014-04-30 15:33 Freecode# 阅读(283) 评论(0) 推荐(0) 编辑
hdu 2199:Can you solve this equation?（二分搜索）
摘要：Can you solve this equation?Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7493Accepted Submissio... 阅读全文
posted @ 2014-04-30 12:11 Freecode# 阅读(253) 评论(0) 推荐(0) 编辑
hdu 1195:Open the Lock（暴力BFS广搜）
摘要：Open the LockTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3847Accepted Submission(s): 1661Probl... 阅读全文
posted @ 2014-04-29 16:38 Freecode# 阅读(351) 评论(0) 推荐(0) 编辑
【ACM - 搜索模板】
摘要：【广搜模板】#include #include #include #include using namespace std;#define MAXX #define MAXYstruct Node{ int x,y; int step;};int n,m; //边界int dx[4... 阅读全文
posted @ 2014-04-29 11:20 Freecode# 阅读(268) 评论(0) 推荐(0) 编辑
hrbustoj 1179:下山（DFS+剪枝）
摘要：下山Time Limit: 1000 MS Memory Limit: 65536 KTotal Submit: 271(111 users) Total Accepted: 129(101 users) Rating: Special Judge: NoDescription下面的矩阵可以... 阅读全文
posted @ 2014-04-26 20:07 Freecode# 阅读(496) 评论(0) 推荐(0) 编辑
hdu 1728:逃离迷宫（DFS，剪枝）
摘要：逃离迷宫Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13562Accepted Submission(s): 3221Problem Descr... 阅读全文
posted @ 2014-04-26 15:22 Freecode# 阅读(963) 评论(0) 推荐(0) 编辑
hdu 1045:Fire Net（DFS经典题）
摘要：Fire NetTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5863Accepted Submission(s): 3280Problem De... 阅读全文
posted @ 2014-04-22 22:53 Freecode# 阅读(1281) 评论(0) 推荐(0) 编辑
hdu 1312:Red and Black（DFS搜索，入门题）
摘要：Red and BlackTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8435Accepted Submission(s): 5248Probl... 阅读全文
posted @ 2014-04-18 21:41 Freecode# 阅读(468) 评论(0) 推荐(0) 编辑
sdut 2152:Balloons（第一届山东省省赛原题，DFS搜索）
摘要：BalloonsTime Limit: 1000MS Memory limit: 65536K题目描述Both Saya and Kudo like balloons. One day, they heard that in the central park, there will be thous... 阅读全文
posted @ 2014-04-13 14:05 Freecode# 阅读(219) 评论(0) 推荐(0) 编辑
hdu 1426:Sudoku Killer（DFS深搜，进阶题目，求数独的解）
摘要：Sudoku KillerTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3723Accepted Submission(s): 1170Problem Description自从2006年3月10日至11日的首届数独世界锦标赛以后，数独这项游戏越来越受到人们的喜爱和重视。据说，在2008北京奥运会上，会将数独列为一个单独的项目进行比赛，冠军将有可能获得的一份巨大的奖品———HDU免费七日游外加lcy亲笔签名以及同hdu acm team合影留 阅读全文
posted @ 2014-04-09 23:44 Freecode# 阅读(1365) 评论(0) 推荐(0) 编辑
hdu 2717:Catch That Cow（bfs广搜，经典题，一维数组搜索）
摘要：Catch That CowTime Limit: 5000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6383Accepted Submission(s): 2034Problem DescriptionFarmer 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 阅读全文
posted @ 2014-04-06 21:25 Freecode# 阅读(622) 评论(0) 推荐(0) 编辑
hdu 1253:胜利大逃亡（基础广搜BFS）
摘要：胜利大逃亡Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 23779Accepted Submission(s): 9125Problem Desc... 阅读全文
posted @ 2014-03-28 09:59 Freecode# 阅读(381) 评论(0) 推荐(0) 编辑
hdu 1181:变形课（搜索水题）
摘要：变形课Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 11935Accepted Submission(s): 4418Problem Description呃......变形课上Harry碰到了一点小麻烦,因为他并不像Hermione那样能够记住所有的咒语而随意的将一个棒球变成刺猬什么的,但是他发现了变形咒语的一个统一规律:如果咒语是以a开头b结尾的一个单词,那么它的作用就恰好是使A物体变成B物体.Harry已经将他所会的所有咒语都列成了一 阅读全文
posted @ 2014-03-25 17:34 Freecode# 阅读(552) 评论(0) 推荐(0) 编辑
poj 2386:Lake Counting（简单DFS深搜）
摘要：Lake CountingTime Limit:1000MSMemory Limit:65536KTotal Submissions:18201Accepted:9192DescriptionDue to recent rains, water has pooled in various places in Farmer John's field, which is represented by a rectangle of N x M (1 2 3 using namespace std; 4 int n,m; 5 char a[105][105]; 6 int dx[8] = {0 阅读全文
posted @ 2014-03-24 15:08 Freecode# 阅读(271) 评论(0) 推荐(0) 编辑
hdu 2553:N皇后问题（DFS遍历，水题）
摘要：N皇后问题Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6905Accepted Submission(s): 3128Problem Description在N*N的方格棋盘放置了N个皇后，使得它们不相互攻击（即任意2个皇后不允许处在同一排，同一列，也不允许处在与棋盘边框成45角的斜线上。你的任务是，对于给定的N，求出有多少种合法的放置方法。Input共有若干行，每行一个正整数N≤10，表示棋盘和皇后的数量；如果N=0，表示结束。Outpu 阅读全文
posted @ 2014-03-05 17:39 Freecode# 阅读(4112) 评论(0) 推荐(0) 编辑
hdu 1022:Train Problem I（数据结构，栈，递归，dfs）
摘要：Train Problem ITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18095Accepted Submission(s): 6764Problem DescriptionAs the new term comes, the Ignatius Train Station is very busy nowadays. A lot of student want to get back to school by train(because 阅读全文
posted @ 2014-02-14 23:38 Freecode# 阅读(831) 评论(0) 推荐(0) 编辑

1 2 下一页
点击右上角即可分享
微信分享提示