摘要: Fire Net Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14780 Accepted Submission(s): 8932 Probl 阅读全文
posted @ 2018-07-31 21:12 西*风 阅读(250) 评论(0) 推荐(0)
摘要: 传送门: http://acm.hdu.edu.cn/showproblem.php?pid=1009 FatMouse' Trade Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)To 阅读全文
posted @ 2018-07-31 20:43 西*风 阅读(193) 评论(0) 推荐(0)
摘要: A:合并果子(贪心+优先队列)B:HDU 1789 Doing Homework again(非常经典的贪心)C:11572 - Unique Snowflakes(贪心,两指针滑动保存子段最大长度)D:POJ 1328 Radar Installation(很新颖的贪心,区间贪心)E:HDU 1053 Entropy(哈夫曼编码 贪心+优先队列)F:POJ 3122 Pie(二分+贪心)G:HD... 阅读全文
posted @ 2018-07-31 20:32 西*风 阅读(132) 评论(0) 推荐(0)
摘要: 题目戳我 字数统计 Time Limit: 1000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3021 Accepted Submission(s): 812 Proble 阅读全文
posted @ 2018-07-31 20:23 西*风 阅读(308) 评论(0) 推荐(0)
摘要: 传送门: http://acm.hdu.edu.cn/showproblem.php?pid=4864 Task Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submiss 阅读全文
posted @ 2018-07-31 19:10 西*风 阅读(373) 评论(0) 推荐(0)
摘要: 题目链接:https://www.51nod.com/onlineJudge/questionCode.html#!problemId=1205 N个作业{1,2,…,n}要在由2台机器M1和M2组成的流水线上完成加工。每个作业加工的顺序都是先在M1上加工,然后在M2上加工。M1和M2加工作业i所需 阅读全文
posted @ 2018-07-31 18:53 西*风 阅读(355) 评论(0) 推荐(0)
摘要: Pie Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 22684 Accepted: 7121 Special Judge Description My birthday is coming up and traditional 阅读全文
posted @ 2018-07-31 17:55 西*风 阅读(218) 评论(0) 推荐(0)
摘要: 传送门: http://acm.hdu.edu.cn/showproblem.php?pid=1053 Entropy Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Subm 阅读全文
posted @ 2018-07-31 17:44 西*风 阅读(443) 评论(0) 推荐(0)
摘要: Radar Installation Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 106491 Accepted: 23648 Description Assume the coasting is an infinite st 阅读全文
posted @ 2018-07-31 17:36 西*风 阅读(219) 评论(0) 推荐(0)
摘要: Emily the entrepreneur has a cool business idea: packaging and selling snowflakes. She has devised a machine that captures snowflakes as they fall, and 阅读全文
posted @ 2018-07-31 17:12 西*风 阅读(233) 评论(0) 推荐(0)
摘要: Doing Homework again Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 17622 Accepted Submission(s) 阅读全文
posted @ 2018-07-31 16:58 西*风 阅读(270) 评论(0) 推荐(0)
摘要: 现在有n堆果子,第i堆有ai个果子。现在要把这些果子合并成一堆,每次合并的代价是两堆果子的总果子数。求合并所有果子的最小代价。 Input 第一行包含一个整数T(T<=50),表示数据组数。 每组数据第一行包含一个整数n(2<=n<=1000),表示果子的堆数。 第二行包含n个正整数ai(ai<=1 阅读全文
posted @ 2018-07-31 16:33 西*风 阅读(968) 评论(0) 推荐(0)