ACM_DP
文章平均质量分 81
小白菜小青菜
平凡的脚步也可以走出伟大的行程!
展开
-
南阳理工oj 题目289 苹果 01背包
苹果时间限制:3000 ms | 内存限制:65535 KB 难度:3描述 ctest有n个苹果,要将它放入容量为v的背包。给出第i个苹果的大小和价钱,求出能放入背包的苹果的总价钱最大值。输入 有多组测试数据,每组测试数据第一行为2个正整数,分别代表苹果的个数n和背包的容量v,n、v同时为0时结束测试,此时不输出。接下来的n行,每行2个正整数,用空格隔开,分别代表苹果的大小c和价钱w。原创 2017-05-30 20:23:28 · 248 阅读 · 0 评论 -
HDU 2844 Coins(二进制优化)
- Coins题目链接Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 16702 Accepted Submission(s): 6634Problem Description Whuacmers use coins.They原创 2017-11-13 12:46:54 · 260 阅读 · 0 评论 -
HDU 2639 Bone Collector II (第k优解)
Bone Collector II题目链接Time Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5246 Accepted Submission(s): 2778Problem Description The title of this原创 2017-11-13 13:32:39 · 220 阅读 · 0 评论 -
HDU 2391 Filthy Rich(dp)
Filthy RichTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3736 Accepted Submission(s): 1658Problem Description They say that in Phrygia,原创 2017-11-18 16:58:30 · 231 阅读 · 0 评论 -
HDU 3535 AreYouBusy(多重背包模板)
AreYouBusyTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4604 Accepted Submission(s): 1884Problem Description Happy New Term! As having b原创 2017-11-18 20:50:31 · 199 阅读 · 0 评论 -
HDU 3449 Consumer(有依赖背包)
ConsumerTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/65536 K (Java/Others) Total Submission(s): 2385 Accepted Submission(s): 1269Problem Description FJ is going to do some shoppin原创 2017-11-18 21:27:43 · 234 阅读 · 0 评论 -
HDU 5532 Almost Sorted Array(思维,最长递增子序列,模拟)
Almost Sorted Array题目链接Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others) Total Submission(s): 6642 Accepted Submission(s): 1586Problem Description We are all fa原创 2017-11-14 19:59:33 · 257 阅读 · 0 评论 -
HDU 1114 Piggy-Bank(完全背包)
Piggy-BankTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 27972 Accepted Submission(s): 14127Problem Description Before ACM can do anything原创 2017-11-15 12:52:34 · 214 阅读 · 0 评论 -
HDU 4501 小明系列故事——买年货(三维背包)
小明系列故事——买年货Time Limit: 5000/2000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 3482 Accepted Submission(s): 1635Problem Description 春节将至,小明要去超市购置年货,于是小明去了自己经原创 2017-11-15 20:31:54 · 214 阅读 · 0 评论 -
POJ 1185 炮兵阵地(状态压缩DP)
炮兵阵地Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 14881 Accepted: 5580Description 司令部的将军们打算在N*M的网格地图上部署他们的炮兵部队。一个N*M的地图由N行M列组成,地图的每一格可能是山地(用”H” 表示),也可能是平原(用”P”表示),如下图。在每一格平原地原创 2017-12-03 17:03:45 · 237 阅读 · 0 评论 -
HDU 6170 Two strings(DP)
HDU 6170 Two strings 2017ACM暑期多校联合训练 - Team 9 1010Two strings题目链接Problem Description Giving two strings and you should judge if they are matched. The first string contains lowercase letters and upper原创 2017-08-24 10:39:47 · 286 阅读 · 0 评论 -
HDU 1087 Super Jumping! Jumping! Jumping! (DP,水题)
Super Jumping! Jumping! Jumping!题目链接Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 40667 Accepted Submission(s): 18814Problem Description原创 2017-08-14 17:42:35 · 210 阅读 · 0 评论 -
HDU 1069 Monkey and Banana(DP,水题)
Monkey and Banana题目链接Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 16106 Accepted Submission(s): 8559Problem Description A group of resea原创 2017-08-14 15:20:09 · 274 阅读 · 0 评论 -
HDU 1114 Piggy-Bank(DP,水题)
Piggy-Bank题目链接Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 26906 Accepted Submission(s): 13610Problem Description Before ACM can do anyt原创 2017-08-16 09:41:31 · 239 阅读 · 0 评论 -
背包问题 初始化
背包初始化:初始化的细节问题 我们看到的求最优解的背包问题题目中,事实上有两种不太相同的问法。有的题目要求“恰好装满背包”时的最优解,有的题目则并没有要求必须把背包装满。一种区别这两种问法的实现方法是在初始化的时候有所不同。如果是第一种问法,要求恰好装满背包,那么在初始化时除了F[0] 为0,其它F[1::V] 均设为 1,这样就可以保证最终得到的F[V] 是一种恰好装满背包的最优解。如果并没有要原创 2017-08-16 10:09:05 · 373 阅读 · 0 评论 -
HDU 2577 How to Type (dp,思维)
How to TypeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 7130 Accepted Submission(s): 3222Problem Description Pirates have finished devel原创 2017-07-24 20:26:32 · 5803 阅读 · 0 评论 -
HDU 1029 Ignatius and the Princess IV (DP,水题)
Ignatius and the Princess IVTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32767 K (Java/Others) Total Submission(s): 34042 Accepted Submission(s): 14804题目链接Problem Description “OK,原创 2017-08-14 10:45:46 · 349 阅读 · 0 评论 -
HDU 6143 Killer Names(排列+容斥,dp)
Killer NamesHDU 6143 (容斥+排列组合,dp+整数快速幂) 2017ACM暑期多校联合训练 - Team 8 1011 Killer Names题目链接Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1107 A原创 2017-08-21 09:20:15 · 252 阅读 · 0 评论 -
HDU 1024 Max Sum Plus Plus (DP,水题)
Max Sum Plus Plus题目链接Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 30905 Accepted Submission(s): 10891Problem Description Now I think you原创 2017-08-12 21:24:32 · 251 阅读 · 0 评论 -
HDU 1003 Max Sum(DP,水题)
Max Sum题目链接Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 253355 Accepted Submission(s): 60124Problem Description Given a sequence a[1],a[原创 2017-08-12 20:36:33 · 213 阅读 · 0 评论 -
程序设计:划分整数(计蒜客)(dp)
程序设计:划分整数蒜头君特别喜欢数学。今天,蒜头君突发奇想:如果想要把一个正整数 nn 分解成不多于 kk 个正整数相加的形式,那么一共有多少种分解的方式呢?蒜头君觉得这个问题实在是太难了,于是他想让你帮帮忙。输入格式 共一行,包含两个整数 n(1 \leq n \leq 300)n(1≤n≤300) 和 k(1 \leq k \leq 300)k(1≤k≤300),含义如题意所示。...原创 2018-03-28 10:52:45 · 1137 阅读 · 0 评论