搜索
齐豪
...
展开
-
DFS
Prime Ring ProblemTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 655 Accepted Submission(s): 387 Problem Descrip原创 2017-01-29 22:54:44 · 221 阅读 · 0 评论 -
N皇后
N皇后问题Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 731 Accepted Submission(s): 423 Problem Description在N*N的原创 2017-01-29 17:56:44 · 280 阅读 · 0 评论 -
Push Box (BFS)
Push BoxTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/65535 K (Java/Others)Total Submission(s): 167 Accepted Submission(s): 81 Problem DescriptionPus原创 2017-01-28 23:48:28 · 499 阅读 · 0 评论 -
BFS
RescueTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1265 Accepted Submission(s): 505 Problem DescriptionAng原创 2017-01-27 16:00:08 · 232 阅读 · 0 评论 -
DFS+奇偶剪枝
Tempter of the BoneTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1572 Accepted Submission(s): 521 Problem Descr原创 2017-01-30 00:02:44 · 301 阅读 · 0 评论 -
数独
Sudoku KillerTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1218 Accepted Submission(s): 386 Problem Description原创 2017-01-30 16:07:48 · 262 阅读 · 0 评论 -
poj-1011-Sticks-(dfs+剪枝)
题目地址http://poj.org/problem?id=1011题目大意给出n个小木棒,组合成若干长度最短棍子解题思路首先将木棒从大到小排序dfs(k, l), k是还剩多少木棒没用,l是当前没组装成功的棍子还需多长木棒剪枝 选取能被木棒总长度能整除的棍子长度如果当前选取木棒的长度比所需的长度大,剪枝如果剩余的木棒总长度还没所需的长度大,剪枝dfs每一次开始选取木棒,要从上一次选取原创 2017-08-24 17:36:32 · 239 阅读 · 0 评论 -
poj-1724-ROADS(dfs)
题目地址http://poj.org/problem?id=1724题目大意N个城市,编号1到N。城市间有R条单向道路。 每条道路连接两个城市,有长度和过路费两个属性。 Bob只有K块钱,他想从城市1走到城市N。问最短共需要走多长的路。如果到不了N,输 出-1解题思路深度优先搜索剪枝 1) 如果当前已经找到的最优路径长度为L ,那么在继续搜索的过程中,总长度已经大 于L的走法,就可以直原创 2017-08-23 22:42:05 · 228 阅读 · 0 评论 -
openjudge-4105-拯救公主-(bfs+)
题目地址http://bailian.openjudge.cn/practice/4105/Code#include <stdio.h>#include <iostream>#include <stdlib.h>#include <string.h>#include <queue>#include <map>#include <vector>#include <math.h>#inc原创 2017-08-25 00:10:04 · 763 阅读 · 4 评论