HDU 1754 I Hate It 2016-09-14 19:01 27人阅读评论(0) 收藏

【HDU 1754 I Hate It 2016-09-14 19:01 27人阅读评论(0) 收藏】的更多相关文章

HDU 1754 I Hate It 2016-09-14 19:01 27人阅读评论(0) 收藏

I Hate It Time Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 66267 Accepted Submission(s): 25776 Problem Description 很多学校流行一种比较的习惯.老师们很喜欢询问,从某某到某某当中,分数最高的是多少. 这让很多学生很反感. 不管你喜不喜欢,现在需要你做的是,就是按照老师…

hdu 1053 (huffman coding, greedy algorithm, std::partition, std::priority_queue ) 分类： hdoj 2015-06-18 19:11 22人阅读评论(0) 收藏

huffman coding, greedy algorithm. std::priority_queue, std::partition, when i use the three commented lines, excution time increase to 15ms from 0ms, due to worse locality? thanks to http://acm.hdu.edu.cn/discuss/problem/post/reply.php?action=support…

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 1036 (I/O routines, fgets, sscanf, %02d, rounding, atoi, strtol) 分类： hdoj 2015-06-16 19:37 32人阅读评论(0) 收藏

thanks to http://stackoverflow.com/questions/2144459/using-scanf-to-accept-user-input and http://stackoverflow.com/questions/456303/how-to-validate-input-using-scanf for the i/o part. thanks to http://www.haodaima.net/art/137347 for the rounding part…

hdu 1712, multiple-choice knapsack, 分类： hdoj 2015-07-18 13:25 152人阅读评论(0) 收藏

reference: 6.4 knapsack in Algorithms(算法概论), Sanjoy Dasgupta University of California, San Diego Christos Papadimitriou University of California at Berkeley Umesh Vazirani University of California at Berkeley the unbounded knapsack and 0-1 knapsack a…