码迷,mamicode.com
首页 >  
搜索关键字:tempter of the bone    ( 343个结果
专题三--1017
题目 Many years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to collect varies of bones , such as dog’s , co... ...
分类:其他好文   时间:2016-05-27 00:38:29    阅读次数:223
(HDU 1010) Tempter of the Bone
HDU 1010 Tempter of the Bone 思路: 小狗走n * m迷宫,从S位置到E位置,时间要正好为T, 每秒走一步,可以向上下左右四个方向走。 DFS + 剪枝: 1、当前位置[x, y],当前所用时间k, 到终点[ex, ey]的最短步数是abs(ex-x) + abs(ey- ...
分类:其他好文   时间:2016-05-24 11:57:19    阅读次数:138
hdu 1010 Tempter of the Bone
Problem Description The doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, an ...
分类:其他好文   时间:2016-05-21 23:19:15    阅读次数:199
Tempter of the Bone---hdu1010(dfs+剪枝)
http://acm.hdu.edu.cn/showproblem.php?pid=1010 折磨我一下午 题目大意: 从s点走到d点能否恰好走k步 刚开始以为是广搜,其实是深搜。 dfs多优化一下才会过。 ...
分类:其他好文   时间:2016-05-13 09:56:49    阅读次数:187
Bone Collector(01背包,模板题)
C - Bone Collector Time Limit:1000MS    Memory Limit:32768KB    64bit IO Format:%I64d & %I64u SubmitStatusPracticeHDU 2602 Description Many years ago , in Teddy’s hometown there was a man ...
分类:其他好文   时间:2016-05-13 02:43:52    阅读次数:191
hdu2639Bone Collector II(第K大背包)
Bone Collector II Time Limit: 5000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3780    Accepted Submission(s): 1947 Problem Description The titl...
分类:其他好文   时间:2016-05-12 21:35:01    阅读次数:141
HDU 专题分类
【背包问题】 2602 Bone Collector 1114 Piggy-Bank 1203 I NEED A OFFER! 1171 Big Event in HDU 1059 Dividing 2844 Coins 2191 悼念512汶川大地震遇难同胞——珍惜现在,感恩生活 2159 FATE 1561 The more, The Better 10...
分类:其他好文   时间:2016-05-07 09:42:46    阅读次数:259
Tempter of the Bone —HDU1010(DFS+剪枝)
Tempter of the Bone Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 102071    Accepted Submission(s): 27649 Problem Description T...
分类:其他好文   时间:2016-05-06 12:49:07    阅读次数:181
HDU 2639 Bone Collector II (DP 第k优解)
题意:输入t,t组测试样例,每组样例输入 n, v, k. 接着输入n个物品的价值,再输入n个物品的体积。求k优解。 分析:dp[n][v][k]表示n个物品,在体积不超过v的情况,第k大的值是多少。dp[i][v][k]与dp[i-1][v][k]与dp[i-1][v-volume[i]]+val ...
分类:其他好文   时间:2016-05-05 12:49:45    阅读次数:100
HDU 2639 01背包求第k大
Bone Collector II Time Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3718 Accepted Submission(s): 19 ...
分类:其他好文   时间:2016-04-28 01:48:08    阅读次数:128
343条   上一页 1 ... 12 13 14 15 16 ... 35 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!