随笔分类 -  ACM-HDU

1 2 3 4 下一页
hdu4282 A very hard mathematic problem
摘要：A very hard mathematic problemTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 991Accepted Submission(s): 287Problem Description Haoren is very good at solving mathematic problems. Today he is working a problem like this: Find three positive integ.. 阅读全文
posted @ 2012-09-10 17:34 mtry 阅读(896) 评论(2) 推荐(1)
hdu4268 Alice and Bob（贪心+multiset）
摘要：Alice and BobTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 559Accepted Submission(s): 224Problem DescriptionAlice and Bob's game never ends. Today, they introduce a new game. In this game, both of them have N different rectangular cards resp 阅读全文
posted @ 2012-09-10 15:41 mtry 阅读(1223) 评论(0) 推荐(0)
hdu3732 Ahui Writes Word（多重背包）经典
摘要：Ahui Writes WordTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1075Accepted Submission(s): 406Problem DescriptionWe all know that English is very important, so Ahui strive for this in order to learn more English words. To know that word has its va 阅读全文
posted @ 2012-08-23 21:41 mtry 阅读(732) 评论(0) 推荐(0)
hdu3496 Watch The Movie（二维背包）
摘要：Watch The MovieTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 3057Accepted Submission(s): 996Problem DescriptionNew semester is coming, and DuoDuo has to go to school tomorrow. She decides to have fun tonight and will be very busy after tonight. S 阅读全文
posted @ 2012-08-22 23:14 mtry 阅读(698) 评论(0) 推荐(0)
hdu3033 I love sneakers!（分组背包+每组至少一个）
摘要：I love sneakers!Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2229Accepted Submission(s): 910Problem DescriptionAfter months of hard working, Iserlohn finally wins awesome amount of scholarship. As a great zealot of sneakers, he decides to spend 阅读全文
posted @ 2012-08-21 23:07 mtry 阅读(1334) 评论(0) 推荐(0)
hdu2955 Robberies（01背包）
摘要：RobberiesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4852Accepted Submission(s): 1844Problem DescriptionThe aspiring Roy the Robber has seen a lot of American movies, and knows that the bad guys usually gets caught in the end, often because the 阅读全文
posted @ 2012-08-17 09:09 mtry 阅读(4134) 评论(0) 推荐(5)
hdu4371 Alice and Bob（博弈论）
摘要：Alice and BobTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 55Accepted Submission(s): 33Problem DescriptionAlice and Bob are interested in playing games. One day, they invent a game which has rules below:1.Firstly, Alice and Bob choose some random 阅读全文
posted @ 2012-08-16 19:20 mtry 阅读(2714) 评论(0) 推荐(0)
hdu3339 In Action（最短路+01背包）
摘要：In ActionTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2099Accepted Submission(s): 695Problem DescriptionSince 1945, when the first nuclear bomb was exploded by the Manhattan Project team in the US, the number of nuclear weapons have soared acros 阅读全文
posted @ 2012-08-16 09:56 mtry 阅读(525) 评论(0) 推荐(0)
hdu4362 Dragon Ball （dp）
摘要：Dragon BallTime Limit: 3000/1500 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 924Accepted Submission(s): 354Problem DescriptionSean has got a Treasure map which shows when and where the dragon balls will appear. some dragon balls will appear in a line at the same tim 阅读全文
posted @ 2012-08-15 23:43 mtry 阅读(572) 评论(0) 推荐(0)
hdu2639 Bone Collector II（背包中第 k 大值）
摘要：Bone Collector IITime Limit: 5000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 832Accepted Submission(s): 395Problem DescriptionThe title of this problem is familiar,isn't it?yeah,if you had took part in the "Rookie Cup" competition,you must have s 阅读全文
posted @ 2012-08-13 22:05 mtry 阅读(828) 评论(0) 推荐(1)
hdu2844 Coins（多重背包+装满背包的最大值）
摘要：CoinsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3287Accepted Submission(s): 1293Problem DescriptionWhuacmers use coins.They have coins of value A1,A2,A3...An Silverland dollar. One day Hibix opened purse and found there were some coins. He dec 阅读全文
posted @ 2012-08-13 09:20 mtry 阅读(1677) 评论(0) 推荐(0)
hdu2159 FATE（二维费用背包+完全背包）
摘要：FATETime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3806Accepted Submission(s): 1667Problem Description最近xhd正在玩一款叫做FATE的游戏，为了得到极品装备，xhd在不停的杀怪做任务。久而久之xhd开始对杀怪产生的厌恶感，但又不得不通过杀怪来升完这最后一级。现在的问题是，xhd升掉最后一级还需n的经验值，xhd还留有m的忍耐度，每杀一个怪xhd会得到相应的经验，并减掉相应的忍耐度。当忍耐 阅读全文
posted @ 2012-08-12 23:29 mtry 阅读(250) 评论(0) 推荐(0)
hdu1864 最大报销额（01背包）
摘要：最大报销额Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10647Accepted Submission(s): 2875Problem Description现有一笔经费可以报销一定额度的发票。允许报销的发票类型包括买图书（A类）、文具（B类）、差旅（C类），要求每张发票的总额不得超过1000元，每张发票上，单项物品的价值不得超过600元。现请你编写程序，在给出的一堆发票中找出可以报销的、不超过给定额度的最大报销额。Input测试输入包含若 阅读全文
posted @ 2012-08-12 22:14 mtry 阅读(194) 评论(0) 推荐(0)
hdu1712 ACboy needs your help（分组背包）
摘要：ACboy needs your helpTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1768Accepted Submission(s): 890Problem DescriptionACboy has N courses this term, and he plans to spend at most M days on study.Of course,the profit he will gain from different cou 阅读全文
posted @ 2012-08-12 20:03 mtry 阅读(756) 评论(0) 推荐(0)
hdu1203 I NEED A OFFER!（概率背包）
摘要：I NEED A OFFER!Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9710Accepted Submission(s): 3584Problem DescriptionSpeakless很早就想出国，现在他已经考完了所有需要的考试，准备了所有要准备的材料，于是，便需要去申请学校了。要申请国外的任何大学，你都要交纳一定的申请费用，这可是很惊人的。Speakless没有多少钱，总共只攒了n万美元。他将在m个学校中选择若干的（当然要在他的 阅读全文
posted @ 2012-08-12 19:18 mtry 阅读(222) 评论(0) 推荐(0)
hdu1080 Human Gene Functions（LCS变形）
摘要：Human Gene FunctionsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1338Accepted Submission(s): 767Problem DescriptionIt is well known that a human gene can be considered as a sequence, consisting of four nucleotides, which are simply denoted by fo 阅读全文
posted @ 2012-08-09 10:51 mtry 阅读(2261) 评论(0) 推荐(0)
hdu1078 FatMouse and Cheese（记忆化搜索）
摘要：FatMouse and CheeseTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2710Accepted Submission(s): 1041Problem DescriptionFatMouse has stored some cheese in a city. The city can be considered as a square grid of dimension n: each grid location is label 阅读全文
posted @ 2012-08-08 15:03 mtry 阅读(1077) 评论(0) 推荐(0)
hdu4339 Query（multiset 或 线段树）
摘要：QueryTime Limit: 20000/10000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 998Accepted Submission(s): 300Problem DescriptionYou are given two strings s1[0..l1], s2[0..l2] and Q - number of queries.Your task is to answer next queries:1) 1 a i c - you should set i-th ch 阅读全文
posted @ 2012-08-04 07:55 mtry 阅读(492) 评论(1) 推荐(0)
hdu4334 Trouble
摘要：TroubleTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 874Accepted Submission(s): 270Problem DescriptionHassan is in trouble. His mathematics teacher has given him a very difficult problem called 5-sum. Please help him.The 5-sum problem is defined 阅读全文
posted @ 2012-08-02 23:04 mtry 阅读(243) 评论(0) 推荐(0)
hdu1059 Dividing （多重背包） 经典
摘要：DividingTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8755Accepted Submission(s): 2374Problem 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-08-01 20:45 mtry 阅读(2366) 评论(0) 推荐(0)

1 2 3 4 下一页