背包 - 随笔分类 - ERKE

C - Coin Change (III)（多重背包二进制优化）

摘要：C -Coin Change (III)Time Limit:2000MSMemory Limit:32768KB64bit IO Format:%lld & %lluSubmitStatusPracticeLightOJ 1233DescriptionIn a strange shop there arentypes of coins of valueA1, A2... An.C1, C2, ... Cndenote the number of coins of valueA1, A2... Anrespectively. You have to find the number of 阅读全文

posted @ 2014-03-05 13:16 ERKE 阅读(205) 评论(0) 推荐(0)

Coin Change (II)(完全背包)

摘要：Coin Change (II)Time Limit:1000MSMemory Limit:32768KB64bit IO Format:%lld & %llu[Submit] [Go Back] [Status]DescriptionIn a strange shop there arentypes of coins of valueA1, A2... An. You have to find the number of ways you can makeKusing the coins. You can use any coin a... 阅读全文

posted @ 2014-03-05 13:12 ERKE 阅读(297) 评论(0) 推荐(0)

Problem 2062 Suneast & Yayamao 二进制（多重背包的理解基础）

摘要：Problem 2062 Suneast & YayamaoAccept: 143Submit: 313Time Limit: 1000 mSecMemory Limit : 32768 KBProblem DescriptionYayamao is so cute that people loves it so much.Everyone wants to buy Yayamao from Suneast (a business man who sells Yayamao).Suneast is a strange business man. He se... 阅读全文

posted @ 2014-03-04 13:02 ERKE 阅读(266) 评论(0) 推荐(0)

2013 ACM/ICPC Asia Regional Hangzhou Online hdu4739 Zhuge Liang's Mines

摘要：Zhuge Liang's MinesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 44Accepted Submission(s): 9 Problem DescriptionIn the ancient three kingdom period, Zhuge Liang was the most famous and smartest military leader. His enemy was Shima Yi, who al 阅读全文

posted @ 2013-09-15 18:00 ERKE 阅读(384) 评论(0) 推荐(0)

poj1014二进制优化多重背包

摘要：DividingTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 53029Accepted: 13506DescriptionMarsha and Bill own a collection of marbles. They want to split the collection among themselves so that both receive an equal share of the marbles. This would be easy if all the marbles had the same value 阅读全文

posted @ 2013-08-14 13:52 ERKE 阅读(178) 评论(0) 推荐(0)

随笔分类 - 背包