Note: This article is available in Chinese only. 本文暂无英文版本。
View original
zoj 3623 B - Battle Ships (完全背包?泛化背包?)
Related
codeforces #319 B - Modulo Sum (抽屉原理,dp)
背包还是理解的不够透彻..
因为每次都是用那个一维形式的.
这道题的做法类似01背包.
hdu 1171 Big Event in HDU (母函数,01背包)
**Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 26534 Accepted Submission(s): 9332 **
Problem Description
Nowadays, we all know that Computer College is the biggest department in HDU. But, maybe you don’t know that Computer College had ever been split into Computer College and Software College in 2002. The splitting is absolutely a big event in HDU! At the same time, it is a trouble thing too. All facilities must go halves. First, all facilities are assessed, and two facilities are thought to be same if they have the same value. It is assumed that there is N (0<N<1000) kinds of facilities (different value, different kinds).
hdu 1203 I NEED A OFFER! (01背包)
I NEED A OFFER! # **Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 18287 Accepted Submission(s): 7320 **
hdu 2546 饭卡 (01背包)
饭卡 # **Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 14225 Accepted Submission(s): 4945 **
bestcoder #56 div 2 B Clarke and problem(dp)
果然dp還是弱項啊啊啊啊.. 不過比最開始的完全無從下手強了不少應該...