hdu2614

hdu2614 Beat BFS or DFS

BeatTimeLimit:6000/2000MS(Java/Others)    MemoryLimit:32768/32768K(Java/Others)TotalSubmission(s):1286    AcceptedSubmission(s):751ProblemDescriptionZtyisamanthatalwaysfullofenthusiasm.Hewantstosolvee
EventQueue·2016-04-24 19:00

hdu2614 Beat--DFS

原题链接：http://acm.hdu.edu.cn/showproblem.php?pid=2614一：原题内容ProblemDescriptionZtyisamanthatalwaysfullofenthusiasm.HewantstosolveeverykindofdifficultyACMproblemintheworld.Andhehasahabitthathedoesnotliketo
LaoJiu_·2015-12-31 10:00

hdu2614:Beat(dfs)

ProblemDescriptionZtyisamanthatalwaysfullofenthusiasm.HewantstosolveeverykindofdifficultyACMproblemintheworld.Andhehasahabitthathedoesnotliketosolveaproblemthatiseasythanproblemhehadsolved.Nowyifenfei
libin56842·2014-12-13 13:00

ACM-DFS之Beat——hdu2614

BeatProblemDescriptionZtyisamanthatalwaysfullofenthusiasm.HewantstosolveeverykindofdifficultyACMproblemintheworld.Andhehasahabitthathedoesnotliketosolveaproblemthatiseasythanproblemhehadsolved.Nowyife
lx417147512·2014-04-02 21:00

hdu2614之简单搜索

BeatTimeLimit:6000/2000MS(Java/Others)    MemoryLimit:32768/32768K(Java/Others)TotalSubmission(s):379    AcceptedSubmission(s):247ProblemDescriptionZtyisamanthatalwaysfullofenthusiasm.Hewantstosolveev
xingyeyongheng·2013-08-11 00:00

HDU2614 Beat

                                                             BeatTimeLimit:6000/2000MS(Java/Others)    MemoryLimit:32768/32768K(Java/Others)TotalSubmission(s):349    AcceptedSubmission(s):225ProblemDe
lsh670660992·2013-07-23 13:00

hdu2614

/*分析：  DFS~，好久牟有写搜索了，囧~。  一开始就想到了搜索，不过和discuss里面那人想的一样，以为要n!才行。不过再仔细一想，错了，不是n!。  仔细想想：搜索中有n条分叉，每条搜索路径都有一个当前刚刚完成的任务，假设为x；而x下一步可以供选择的任务有y个；那么：因为必须要有time[yi]>=time[x]，这个yi才可以被选择。  那么这样想、并分析一下的话(分析部分就不废话了
Ice_Crazy·2012-09-18 16:00
上一页 1 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他