2013年11月14日
hdu 3496 Watch The Movie (二维背包)
摘要： Watch The MovieTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 4613Accepted Submission(s): 1456Problem 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. 阅读全文
posted @ 2013-11-14 23:45 heaventouch 阅读(222) 评论(0) 推荐(0)
hdu 2546 饭卡 (01背包)
摘要： 饭卡Time Limit: 5000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8047Accepted Submission(s): 2749Problem Description电子科大本部食堂的饭卡有一种很诡异的设计，即在购买之前判断余额。如果购买一个商品之前，卡上的剩余金额大于或等于5元，就一定可以购买成功（即使购买后卡上余额为负），否则无法购买（即使金额足够）。所以大家都希望尽量使卡上的余额最少。某天，食堂中有n种菜出售，每种菜可购买一次。已知每种菜的价格以及卡 阅读全文
posted @ 2013-11-14 23:02 heaventouch 阅读(249) 评论(0) 推荐(0)
hdu 1712 ACboy needs your help (分组背包)
摘要： ACboy needs your helpTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3215Accepted Submission(s): 1670Problem 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 co 阅读全文
posted @ 2013-11-14 21:49 heaventouch 阅读(268) 评论(0) 推荐(0)
hdu 1853 Cyclic Tour (二分匹配KM最小权值 或 最小费用最大流)
摘要： Cyclic TourTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/65535 K (Java/Others)Total Submission(s): 1197Accepted Submission(s): 626Problem DescriptionThere are N cities in our country, and M one-way roads connecting them. Now Little Tom wants to make several cyclic tours, which satisfy th 阅读全文
posted @ 2013-11-14 12:43 heaventouch 阅读(239) 评论(0) 推荐(0)