摘要: 题目链接http://acm.hdu.edu.cn/showproblem.php?pid=1026 Ignatius and the Princess I Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768... 阅读全文
posted @ 2015-05-03 11:12 编程菌 阅读(171) 评论(0) 推荐(0) 编辑
摘要: 优先队列 优先队列是一种抽象数据类型(Abstract Date Type,ADT),行为和队列类似,但是先出队的元素不是先进队列的元素,而是队列中优先级最高的元素。 STL的优先队列定义在头文件和 (队列一样),用"priority_queuepq"... 阅读全文
posted @ 2015-05-03 10:11 编程菌 阅读(666) 评论(1) 推荐(1) 编辑
摘要: Super Jumping! Jumping! Jumping! Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 25805 A... 阅读全文
posted @ 2015-05-02 20:45 编程菌 阅读(116) 评论(0) 推荐(0) 编辑
摘要: Crack Mathmen 题目链接:http://acm.sdut.edu.cn/sdutoj/problem.php?action=showproblem&problemid=2165 Time Limit: 1000ms Memory limit: 65536K 有疑问?点这... 阅读全文
posted @ 2015-05-01 10:44 编程菌 阅读(187) 评论(0) 推荐(0) 编辑
摘要: Pixel density 题目链接:http://acm.sdut.edu.cn/sdutoj/problem.php?action=showproblem&problemid=2411 Time Limit: 1000ms Memory limit: 65536K 有疑问... 阅读全文
posted @ 2015-04-30 21:12 编程菌 阅读(180) 评论(0) 推荐(0) 编辑
摘要: Binomial Coeffcients 题目链接:http://acm.sdut.edu.cn/sdutoj/problem.php?action=showproblem&problemid=2164 Time Limit: 1000ms Memory limit: 65536K ... 阅读全文
posted @ 2015-04-30 20:41 编程菌 阅读(224) 评论(0) 推荐(0) 编辑
摘要: 人见人爱A^B Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 27338 Accepted Submission(s): 18... 阅读全文
posted @ 2015-04-30 15:27 编程菌 阅读(198) 评论(0) 推荐(0) 编辑
摘要: The 3n + 1 problem Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 26353 Accepted Submis... 阅读全文
posted @ 2015-04-30 14:11 编程菌 阅读(196) 评论(0) 推荐(0) 编辑
摘要: 最少拦截系统 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 23724 Accepted Submission(s): 930... 阅读全文
posted @ 2015-04-28 08:01 编程菌 阅读(199) 评论(0) 推荐(0) 编辑
摘要: What Are You Talking About Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 102400/204800 K (Java/Others) Total Submission(s): 15369 Acce... 阅读全文
posted @ 2015-04-27 18:50 编程菌 阅读(175) 评论(0) 推荐(0) 编辑