搜索
关注
分享
扫一扫
文章平均质量分 73
ten_three
这个作者很懒，什么都没留下…
展开
-
hdu 1584 搜索水题
#include#includeusing namespace std;int pcards[11],sign[11],minn;int jian(int a,int b){ if(a>b) return a-b; else return b-a;}void dfs(int lcard,int steps){ int i,j; for(i=1;i<=原创 2013-05-30 20:20:29 · 784 阅读 · 0 评论 -
CF369C（深搜巧用）
地址：http://codeforces.com/contest/369/problem/CC. Valera and Electionstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutput原创 2013-11-30 15:39:20 · 1354 阅读 · 0 评论 -
hdu1430（康拓展开+bfs打表）
地址：http://acm.hdu.edu.cn/showproblem.php?pid=1430魔板Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1527 Accepted Submission(s): 311原创 2013-09-23 21:52:39 · 807 阅读 · 0 评论 -
hunnuoj11370（运用状态压缩来剪枝的dfs）
地址：http://acm.hunnu.edu.cn/online/?action=problem&type=show&id=11370&courseid=0Problem A: KingdomsSeveral kingdoms got into serious financial troubles. For many years, they have been secretlyborr原创 2013-09-12 20:09:36 · 982 阅读 · 0 评论 -
hdu1429(bfs利用状态压缩）
地址：http://acm.hdu.edu.cn/showproblem.php?pid=1429胜利大逃亡(续)Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3803 Accepted Submission(s原创 2013-07-29 11:20:59 · 634 阅读 · 0 评论 -
hdu1254（bfs+bfs）
地址：http://acm.hdu.edu.cn/showproblem.php?pid=1254推箱子Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4040 Accepted Submission(s): 11原创 2013-07-26 19:19:19 · 856 阅读 · 0 评论 -
hdu1072（只标记特殊值的记忆化搜索）
地址：http://acm.hdu.edu.cn/showproblem.php?pid=1072NightmareTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5463 Accepted Submission(原创 2013-07-25 21:26:53 · 736 阅读 · 0 评论 -
hdu1026
地址：http://acm.hdu.edu.cn/showproblem.php?pid=1026Ignatius and the Princess ITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9567 Ac原创 2013-07-25 16:29:03 · 666 阅读 · 0 评论 -
hdu1010
地址:http://acm.hdu.edu.cn/showproblem.php?pid=1010Tempter of the BoneTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 52134 Accepted原创 2013-07-24 21:12:51 · 747 阅读 · 0 评论 -
hdu1180
地址：http://acm.hdu.edu.cn/showproblem.php?pid=1180 诡异的楼梯Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 6963 Accepted Submission(s):原创 2013-07-24 15:33:33 · 641 阅读 · 0 评论 -
hdu1253
地址：点击打开链接 胜利大逃亡Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 21234 Accepted Submission(s): 8392Problem DescriptionIgnatius被原创 2013-07-22 12:32:02 · 618 阅读 · 0 评论 -
hdu1495
地址： http://write.blog.youkuaiyun.com/postedit非常可乐Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3331 Accepted Submission(s): 1368原创 2013-07-21 15:23:21 · 1261 阅读 · 0 评论 -
hdu1175 暴力简单bfs
连连看Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13521 Accepted Submission(s): 3528Problem Description“连连看”相信很多人都玩过。没玩过也没原创 2013-07-19 11:27:55 · 776 阅读 · 0 评论 -
hdu1195 bfs
Open the LockTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2897 Accepted Submission(s): 1263Problem DescriptionNow an emergent原创 2013-07-18 21:09:57 · 721 阅读 · 0 评论 -
hdu1372 简单bfs
Knight MovesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4823 Accepted Submission(s): 2962Problem DescriptionA friend of y原创 2013-07-18 17:07:01 · 765 阅读 · 0 评论 -
hdu2612 bfs
Find a wayTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2673 Accepted Submission(s): 864Problem DescriptionPass a year lear原创 2013-07-18 15:50:10 · 736 阅读 · 0 评论 -
hdu1258 被简单搜索坑了
Sum It UpTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2918 Accepted Submission(s): 1461Problem DescriptionGiven a specifie原创 2013-07-17 21:54:46 · 1421 阅读 · 0 评论 -
hdu1045 （DFS)
#include#include#includeusing namespace std;int s[10][10];int maxs,n;void dfs(int x,int y,int m) //根据是否建造攻击塔来深搜{ int i,j,g; if(y==n+1) { if(maxs<m) maxs=m; return; } if(s[x][y]==原创 2013-07-15 19:16:23 · 693 阅读 · 0 评论 -
zoj3761（BFS）
地址：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=5206Easy billiardsTime Limit: 2 Seconds Memory Limit: 65536 KB Special JudgeEdward think a game of billiards is to原创 2014-03-04 21:18:44 · 811 阅读 · 0 评论