摘要:
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 course depending on the days he spend on it.How to arrange the M days for the N courses to maximize the profit?InputThe input consists of multiple data sets. A dat 阅读全文
posted @ 2013-10-07 17:54
蓝色记忆2013
阅读(228)
评论(0)
推荐(0)
摘要:
DescriptionThe 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 #include#include#includeusing namespace std;struct Node{ int h,c; int lim;}node[401];int dp[50000];int H;void ZeroOnePack(int cost,int weight,int lim... 阅读全文
posted @ 2013-10-07 17:38
蓝色记忆2013
阅读(179)
评论(0)
推荐(0)

浙公网安备 33010602011771号