搜索
say_c_box
小白不能不努力~
展开
-
POJ 2718——穷竭搜索,全排列生成
题目: Smallest Difference Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 8100 Accepted: 2221 Description Given a number of distinct decimal digits, y原创 2016-07-17 10:52:53 · 393 阅读 · 0 评论 -
POJ 3050——Hopscotch(dfs,爆搜)
题目: Hopscotch Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 3239 Accepted: 2245 Description The cows play the child's game of hopscotch in a non-t原创 2016-07-17 11:35:39 · 294 阅读 · 0 评论 -
HDU5444(2015长春网赛)——Elven Postman(树的遍历,dfs)
Elven Postman Time Limit: 1500/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 1680 Accepted Submission(s): 959 Problem Description Elves are v原创 2016-09-09 21:17:57 · 414 阅读 · 0 评论 -
HDU5816(2016多校第七场)——Hearthstone(暴力枚举,状态压缩)
Hearthstone Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 488 Accepted Submission(s): 206 Problem Description Hearthstone is a原创 2016-08-10 13:32:08 · 894 阅读 · 0 评论 -
Codeforces Round #383 (Div. 2)全部题解 (A,B,C,D,E)
A. Arpa’s hard exam and Mehrdad’s naive cheat time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output There exists a原创 2016-12-07 19:09:15 · 1844 阅读 · 0 评论 -
Gym - 101164I————Cubes(上限深搜+剪枝)
原题:https://odzkskevi.qnssl.com/7d71640f76f4ed51faafa04ff328c42f?v=1486375985 把一个数分解为尽可能少的数的立方和。 因为是立方和,所以如果深搜的话深度不会很大。所以可以设置一个上限进行爆搜,并且加入剪枝操作。 不过这个深度得好好考虑,剪枝也会卡比较小的地方。 实践证明50层是可以过的。 #include usi原创 2017-03-01 21:02:00 · 526 阅读 · 0 评论 -
codeforcodeforces 808D——Array Division(查找,set)
D. Array Division time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Vasya has an array a consisting of positi原创 2017-05-16 08:31:15 · 1228 阅读 · 0 评论 -
codeforces 811D——Vladik and Favorite Game(bfs)
D. Vladik and Favorite Game time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output This is an interactive problem.原创 2017-05-28 13:03:08 · 713 阅读 · 0 评论