ACM_队列_贪心算法
文章平均质量分 77
三茶先生
life is so long,bu needs you to face~
展开
-
HDU2192建房子
MagicBuildingTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1976 Accepted Submission(s): 887Problem DescriptionAs the increase o原创 2016-03-29 17:01:02 · 265 阅读 · 0 评论 -
HDu4864
TaskTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5447 Accepted Submission(s): 1425Problem DescriptionToday the company has m t原创 2016-04-11 21:34:09 · 488 阅读 · 0 评论 -
HDU1052
Tian Ji -- The Horse RacingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 24826 Accepted Submission(s): 7234Problem DescriptionH原创 2016-03-26 17:22:16 · 322 阅读 · 0 评论 -
HDU5281GUN
Senior's GunTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1881 Accepted Submission(s): 625Problem DescriptionXuejiejie is a beautif原创 2016-04-11 22:26:49 · 241 阅读 · 0 评论 -
ZCCZCC Loves Codefires
ZCC Loves CodefiresTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0Problem Description Though ZC原创 2016-04-07 21:45:11 · 321 阅读 · 0 评论 -
HDU1009
FatMouse prepared M pounds of cat food, ready to trade with the cats guarding the warehouse containing his favorite food, JavaBean.The warehouse has N rooms. The i-th room contains J[i] pounds of Ja转载 2016-03-23 21:34:34 · 304 阅读 · 0 评论 -
pojsupermark
SupermarketTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 9103 Accepted: 3891DescriptionA supermarket has a set Prod of products on sale. It earns a原创 2016-04-05 16:46:21 · 204 阅读 · 0 评论 -
HDU1050
The famous ACM (Advanced Computer Maker) Company has rented a floor of a building whose shape is in the following figure.The floor has 200 rooms each on the north side and south side along原创 2016-03-23 14:12:41 · 634 阅读 · 0 评论 -
蓝桥杯翻硬币
问题描述小明正在玩一个“翻硬币”的游戏。桌上放着排成一排的若干硬币。我们用 * 表示正面,用 o 表示反面(是小写字母,不是零)。比如,可能情形是:**oo***oooo如果同时翻转左边的两个硬币,则变为:oooo***oooo现在小明的问题是:如果已知了初始状态和要达到的目标状态,每次只能同时翻转相邻的两个硬币,那么对特定的局面,最少要翻动多少次呢?原创 2016-03-31 20:03:27 · 289 阅读 · 0 评论 -
HDU1051切割木头
Wooden SticksTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16938 Accepted Submission(s): 6910Problem DescriptionThere is a pile原创 2016-03-29 17:52:52 · 635 阅读 · 0 评论 -
poj3253Fence Repair(哈夫曼树)
Fence Repair Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 50638 Accepted: 16615 DescriptionFarmer John wants to repair a small length of the fence around the pasture. He me原创 2017-07-20 20:47:49 · 249 阅读 · 0 评论