搜索 - 随笔分类(第2页) - vCoders

POJ2785(upper_bound)

摘要：#include"cstdio"#include"algorithm"using namespace std;const int MAXN=4005;int A[MAXN],B[MAXN],C[MAXN],D[MAXN];int CD[MAXN*MAXN];int n;int main(){ ... 阅读全文

posted @ 2015-11-27 09:38 vCoders 阅读(163) 评论(0) 推荐(0)

POJ1088(记忆化搜索)

摘要：经典记忆化搜索题目。当从每个点一次进行搜索时要采用记忆化搜索#include"cstdio"#include"algorithm"using namespace std;const int MAXN=105;int g[MAXN][MAXN];int t[MAXN][MAXN];int maxn... 阅读全文

posted @ 2015-11-23 21:52 vCoders 阅读(186) 评论(0) 推荐(0)

HDOJ2553(2N皇后问题)

摘要：N皇后问题 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 15419 Accepted Submission(s): 7009 Problem 阅读全文

posted @ 2015-08-30 21:11 vCoders 阅读(133) 评论(0) 推荐(0)

HDOJ1242(延时迷宫BFS+优先队列)

摘要：Rescue Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25485 Accepted Submission(s): 9022 Problem 阅读全文

posted @ 2015-08-28 20:05 vCoders 阅读(151) 评论(0) 推荐(0)

HDOJ1015(简单深搜)

摘要：Safecracker Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12702 Accepted Submission(s): 6581 Pr 阅读全文

posted @ 2015-07-30 15:34 vCoders 阅读(310) 评论(0) 推荐(0)

HDOJ1016(标准dfs)

摘要：Prime Ring Problem Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 42688 Accepted Submission(s): 阅读全文

posted @ 2015-07-27 17:45 vCoders 阅读(168) 评论(0) 推荐(0)

蓝桥杯带分数(全排列+剪枝)

摘要：问题描述 100 可以表示为带分数的形式：100 = 3 + 69258 / 714。还可以表示为：100 = 82 + 3546 / 197。注意特征：带分数中，数字1~9分别出现且只出现一次（不包含0）。类似这样的带分数，100 有 11 种表示法。输入格式从标准输入读入一个正整数N 阅读全文

posted @ 2015-07-27 15:11 vCoders 阅读(223) 评论(0) 推荐(0)

HDOJ1010 (DFS+奇偶剪枝)

摘要：Tempter of the Bone Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 107043 Accepted Submission(s) 阅读全文

posted @ 2015-07-27 11:55 vCoders 阅读(625) 评论(0) 推荐(0)

随笔分类 - 搜索