kuangbin - 博客园

POJ 3186 Treats for the Cows （简单DP）

摘要： Treats for the CowsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 3689Accepted: 1844DescriptionFJ has purchased N (1 <= N <= 2000) yummy treats for the cows who get money for giving vast amounts of milk. FJ sells one treat per day and wants to maximize the money he receives over a gi 阅读全文

posted @ 2012-09-20 10:02 kuangbin 阅读(1139) 评论(0) 推荐(0)

POJ 2392 Space Elevator （多重背包）

摘要： Space ElevatorTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 6422Accepted: 2965DescriptionThe cows are going to space! They plan to achieve orbit by building a sort of space elevator: a giant tower of blocks. They have K (1 <= K <= 400) different types of blocks with which to build t 阅读全文

posted @ 2012-09-20 09:27 kuangbin 阅读(1598) 评论(0) 推荐(0)

HDU 4291 A Short problem 第37届ACM/ICPC 成都赛区网络赛1004题（找规律，取模求循环节）

摘要： A Short problemTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 344Accepted Submission(s): 131Problem Description According to a research, VIM users tend to have shorter fingers, compared with Emacs users. Hence they prefer problems short, too. He.. 阅读全文

posted @ 2012-09-17 15:48 kuangbin 阅读(1643) 评论(0) 推荐(0)

HDU 4289 Control 第37届ACM/ICPC 成都赛区网络赛1002题（最大流）

摘要： ControlTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 238Accepted Submission(s): 135Problem Description You, the head of Department of Security, recently received a top-secret information that a group of terrorists is planning to transport some W. 阅读全文

posted @ 2012-09-17 13:01 kuangbin 阅读(823) 评论(0) 推荐(0)

HDU 4296 Buildings 第37届ACM/ICPC 成都赛区网络赛1009题（贪心）

摘要： BuildingsTime Limit: 5000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 155Accepted Submission(s): 72Problem Description Have you ever heard the story of Blue.Mary, the great civil engineer? Unlike Mr. Wolowitz, Dr. Blue.Mary has accomplished many great projects. 阅读全文

posted @ 2012-09-16 19:36 kuangbin 阅读(876) 评论(0) 推荐(0)

HDU 4292 Food 第37届ACM/ICPC 成都赛区网络赛1005题（最大流）

摘要： FoodTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 76Accepted Submission(s): 47Problem Description You, a part-time dining service worker in your college’s dining hall, are now confused with a new problem: serve as many people as possible. The i.. 阅读全文

posted @ 2012-09-16 19:34 kuangbin 阅读(1159) 评论(0) 推荐(0)

HDU 4288 Coder 第37届ACM/ICPC 成都赛区网络赛1001题（线段树）

摘要： CoderTime Limit: 20000/10000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 120Accepted Submission(s): 52Problem Description In mathematics and computer science, an algorithm describes a set of procedures or instructions that define a procedure. The term has become in. 阅读全文

posted @ 2012-09-16 19:29 kuangbin 阅读(1359) 评论(0) 推荐(0)

POJ 3264 Balanced Lineup(RMQ)

摘要： Balanced LineupTime Limit: 5000MSMemory Limit: 65536KTotal Submissions: 24349Accepted: 11348Case Time Limit: 2000MSDescriptionFor the daily milking, Farmer John's N cows (1 ≤ N ≤ 50,000) always line up in the same order. One day Farmer John decides to organize a game of Ultimate Frisbee with som 阅读全文

posted @ 2012-09-16 09:34 kuangbin 阅读(1127) 评论(0) 推荐(0)

POJ 1276 Cash Machine（多重背包）

摘要： Cash MachineTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 20470Accepted: 7162DescriptionA Bank plans to install a machine for cash withdrawal. The machine is able to deliver appropriate @ bills for a requested cash amount. The machine uses exactly N distinct bill denominations, say Dk, k= 阅读全文

posted @ 2012-09-15 17:06 kuangbin 阅读(526) 评论(0) 推荐(0)

HDU 1059 Dividing（多重背包）

摘要： DividingTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9749Accepted Submission(s): 2703Problem DescriptionMarsha and Bill own a collection of marbles. They want to split the collection among themselves so that both receive an equal share of the ma 阅读全文

posted @ 2012-09-15 16:34 kuangbin 阅读(509) 评论(0) 推荐(0)