hdu1171 Big Event in HDU（01背包） 2016-05-28 16:32 75人阅读评论(0) 收藏

【hdu1171 Big Event in HDU（01背包） 2016-05-28 16:32 75人阅读评论(0) 收藏】的更多相关文章

hdu1171 Big Event in HDU（01背包） 2016-05-28 16:32 75人阅读评论(0) 收藏

Big Event in HDU Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 34556 Accepted Submission(s): 11986 Problem Description Nowadays, we all know that Computer College is the biggest departmen…

one recursive approach for 3, hdu 1016 (with an improved version) , permutations, N-Queens puzzle 分类： hdoj 2015-07-19 16:49 86人阅读评论(0) 收藏

one recursive approach to solve hdu 1016, list all permutations, solve N-Queens puzzle. reference: the video of stanford cs106b lecture 10 by Julie Zelenski https://www.youtube.com/watch?v=NdF1QDTRkck // hdu 1016, 795MS #include <cstdio> #include &l…

hdu 1052 (greedy algorithm) 分类： hdoj 2015-06-18 16:49 35人阅读评论(0) 收藏

thanks to http://acm.hdu.edu.cn/discuss/problem/post/reply.php?action=support&postid=19638&messageid=1&deep=0 for the test case provided. below is an excerpt data 8 11 9 8 8 8 4 3 2 11 8 8 8 8 4 3 2 answer 800 #include <cstdio> #include…

hdu 1503, LCS variants, find a LCS, not just the length, backtrack to find LCS, no extra markup 分类： hdoj 2015-07-18 16:24 139人阅读评论(0) 收藏

a typical variant of LCS algo. the key point here is, the dp[][] array contains enough message to determine the LCS, not only the length, but all of LCS candidate, we can backtrack to find all of LCS. for backtrack, one criteria is dp[i-1][j]==dp[i][…

Improving the GPA 分类：贪心 HDU 比赛 2015-08-08 16:12 11人阅读评论(0) 收藏

Improving the GPA Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 606 Accepted Submission(s): 451 Problem Description Xueba: Using the 4-Point Scale, my GPA is 4.0. In fact, the AVERAGE SCORE of…

Task schedule 分类：比赛 HDU 查找 2015-08-08 16:00 2人阅读评论(0) 收藏

Task schedule Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1909 Accepted Submission(s): 658 Problem Description 有一台机器,并且给你这台机器的工作表,工作表上有n个任务,机器在ti时间执行第i个任务,1秒即可完成1个任务. 有m个询问,每个询问有一个数字q,表示如果在q时间…

hdu 1034 (preprocess optimization, property of division to avoid if, decreasing order process) 分类： hdoj 2015-06-16 13:32 39人阅读评论(0) 收藏

IMO, version 1 better than version 2, version 2 better than version 3. make some preprocess to make you code simple and efficient. Here divide the input by 2, so you don't have to do dividsion on each loop. version 1 is best thanks to http://www.cnbl…