![](https://img-blog.csdnimg.cn/20201014180756930.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
搜索
豫帝哥哥
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
展开
-
NYOJ 组合数 32(DFS)
组合数时间限制:3000 ms | 内存限制:65535 KB难度:3描述找出从自然数1、2、... 、n(0<n<10)中任取r(0<r<=n)个数的所有组合。输入输入n、r。输出按特定顺序输出所有组合。特定顺序:每一个组合中的值从大到小排列,组合之间按逆字典序排列。样例输入5 3样例输出543542541532原创 2015-01-30 20:10:26 · 589 阅读 · 0 评论 -
HDOJ 胜利大逃亡 1253
胜利大逃亡Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 27577 Accepted Submission(s): 10501Problem DescriptionIgnatius被魔王抓走了,有一天魔王出差原创 2015-02-06 23:23:30 · 752 阅读 · 0 评论 -
bin神专题 迷宫问题
K - 迷宫问题Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusDescription定义一个二维数组: int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0,原创 2015-02-02 23:46:40 · 790 阅读 · 0 评论 -
NYOJ 部分和问题 8(DFS)
部分和问题时间限制:1000 ms | 内存限制:65535 KB难度:2描述给定整数a1、a2、.......an,判断是否可以从中选出若干数,使它们的和恰好为K。输入首先,n和k,n表示数的个数,k表示数的和。接着一行n个数。(1输出如果和恰好可以为k,输出“YES”,并按输入顺序依次输出是由哪几个数的和组成,否则“NO”样例输入原创 2015-01-27 19:00:02 · 927 阅读 · 0 评论 -
01背包问题几种算法实现
最简单的就是利用搜索,把每一种情况都考虑。//深度搜索。复杂度O(2^n) int dfs(int i,int j){ int res;//剩余的空间量。 if(i==n)res=0;//如果i==n则剩余空间量为0。 else if(j<w[i]) res=dfs(i+1,j);//如果物品太大,不装进去。 else res=max(dfs(i+1,j),dfs(i+1,原创 2015-01-29 15:50:42 · 3083 阅读 · 0 评论 -
POJ Lake Counting 2386(DFS)
Lake CountingTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 21594 Accepted: 10873DescriptionDue to recent rains, water has pooled in various places in原创 2015-01-27 21:37:05 · 666 阅读 · 0 评论 -
HDOJ Red and Black 1312(入门级DFS)
Red and BlackTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10410 Accepted Submission(s): 6505Problem DescriptionThere is a rect原创 2015-01-02 16:30:28 · 774 阅读 · 0 评论 -
NYOJ 最少步数 58(BFS)
最少步数时间限制:3000 ms | 内存限制:65535 KB难度:4描述这有一个迷宫,有0~8行和0~8列: 1,1,1,1,1,1,1,1,1 1,0,0,1,0,0,1,0,1 1,0,0,1,1,0,0,0,1 1,0,1,0,1,1,0,1,1 1,0,0,0,0,1,0,0,1 1,1,0,1,0,1,0,0,1原创 2015-01-28 00:12:29 · 868 阅读 · 0 评论 -
HDOJ 非常可乐 1495【BFS】
非常可乐Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7025 Accepted Submission(s): 2810Problem Description大家一定觉的运动以后喝可乐是一件很惬意的事原创 2015-07-20 19:25:47 · 1116 阅读 · 0 评论 -
HDOJ N皇后问题 2553【回溯搜索】
N皇后问题Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12323 Accepted Submission(s): 5555Problem Description在N*N的方格棋盘放置了N个皇后,使得原创 2015-07-20 20:17:33 · 815 阅读 · 0 评论 -
HDOJ Robot Motion 1035
Robot MotionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8004 Accepted Submission(s): 3701Problem DescriptionA robot h原创 2015-07-20 21:41:41 · 622 阅读 · 0 评论 -
HDOJ A计划 2102【BFS】
A计划Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11815 Accepted Submission(s): 2904Problem Description可怜的公主在一次次被魔王掳走一次次被骑士们原创 2015-06-09 17:34:04 · 667 阅读 · 0 评论 -
HDOJ Sudoku Killer 1426【DFS】
Sudoku KillerTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4880 Accepted Submission(s): 1569Problem Description自从2006年3月10日原创 2015-06-23 22:47:19 · 627 阅读 · 0 评论 -
POJ Dungeon Master 2251
Dungeon MasterTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 17965 Accepted: 6974DescriptionYou are trapped in a 3D dungeon and need to find the quicke原创 2015-02-06 23:42:34 · 597 阅读 · 0 评论 -
bin神专题 Oil Deposits
L - Oil DepositsTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionThe GeoSurvComp geologic survey company is responsible for detecti原创 2015-02-06 16:47:34 · 564 阅读 · 0 评论 -
NYOJ The partial sum problem 927
The partial sum problem时间限制:1000 ms | 内存限制:65535 KB难度:2描述One day,Tom’s girlfriend give him an array A which contains N integers and asked him:Can you choose some integers from the N原创 2015-01-30 20:53:04 · 708 阅读 · 0 评论 -
【BFS】HDOJ Dating with girls(2) 2579
Dating with girls(2)Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2606 Accepted Submission(s): 724Problem DescriptionIf you原创 2015-11-01 12:14:48 · 650 阅读 · 0 评论