
oj_Dynamic Programming
文章平均质量分 69
昆libra
这个作者很懒,什么都没留下…
展开
-
杭电OJ2602--------Bone Collector---------01背包
Problem DescriptionMany years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to collect varies of bones , such as dog’s , cow’s , also he went to the grav原创 2012-08-10 15:31:45 · 1171 阅读 · 0 评论 -
动态规划-----背包问题-----01背包,完全背包,多重背包
原文地址:http://www.wutianqi.com/?p=539首先把三种情况放在一起来看:01背包(ZeroOnePack): 有N件物品和一个容量为V的背包。(每种物品均只有一件)第i件物品的费用是c[i],价值是w[i]。求解将哪些物品装入背包可使价值总和最大。完全背包(CompletePack):有N种物品和一个容量为V的背包,每种物品都有无限件可用。第i种物品的转载 2012-08-10 20:01:03 · 11309 阅读 · 2 评论 -
南阳理工OJ547---------------HDOJ1059---------多重背包~~~~有模板!!
Divideing Jewels时间限制:1000 ms | 内存限制:65535 KB难度:4描述Mary and Rose own a collection of jewells. They want to split the collection among themselves so that both receive an equal share of the j原创 2012-08-11 14:29:57 · 1608 阅读 · 0 评论 -
杭电OJ2191---------------------悼念512汶川大地震遇难同胞 -------多重背包
急!灾区的食物依然短缺!为了挽救灾区同胞的生命,心系灾区同胞的你准备自己采购一些粮食支援灾区,现在假设你一共有资金n元,而市场有m种大米,每种大米都是袋装产品,其价格不等,并且只能整袋购买。请问:你用有限的资金最多能采购多少公斤粮食呢?Input输入数据首先包含一个正整数C,表示有C组测试用例,每组测试用例的第一行是两个整数n和m(1 O原创 2012-08-10 19:28:55 · 1878 阅读 · 0 评论 -
杭电OJ1114----------------Piggy-Bank ~完全背包~
Problem DescriptionBefore ACM can do anything, a budget must be prepared and the necessary financial support obtained. The main income for this action comes from Irreversibly Bound Money (IBM). Th原创 2012-08-10 18:13:50 · 783 阅读 · 0 评论 -
zoj1076----------------Gene Assembly 动态规划,最大上升序列
Statement of the ProblemWith the large amount of genomic DNA sequence data being made available, it is becoming more important to find genes (parts of the genomic DNA which are responsible for the s原创 2012-08-14 16:28:50 · 824 阅读 · 0 评论