- 博客(8)
- 收藏
- 关注
RSS订阅原创 Big Number（HDU 1018）
Big Number Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 26509 Accepted Submission(s): 12068 Problem Description In many appli
2014-10-30 20:25:04
657
原创 Codeforces Round #275 (Div. 2) —— C
C. Diverse Permutation time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Permutation p is an ordered set of in
2014-10-30 09:18:49
774
原创 RP问题（HDU 1574）—— 0-1背包（需深入理解）
RP问题 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 826 Accepted Submission(s): 266 Problem Description 在人类社会中，任何个体都具有人品，人品有各种不同的形式，可以从一种
2014-10-16 21:54:59
828
原创 Operation the Sequence（HDU 5063）
Operation the Sequence Time Limit: 3000/1500 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 440 Accepted Submission(s): 181 Problem Description You have an arr
2014-10-16 08:37:27
692
原创 Sum vs Product（ACdream） —— dfs
I - Sum vs Product Time Limit: 4000/2000MS (Java/Others) Memory Limit: 128000/64000KB (Java/Others) SubmitStatus Problem Description Peter has just learned mathematics. He learne
2014-10-16 08:06:52
892
转载 Ants（POJ 1852）
Ants Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 9974 Accepted: 4414 Description An army of ants walk on a horizontal pole of length l cm, each with a co
2014-10-09 19:37:03
669
原创 Help him (BestCoder Round #12) HDU 5059
Help him Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1829 Accepted Submission(s): 137 Problem Description As you know, when you wa
2014-10-06 09:45:55
809
转载 分组背包
问题: 有N件物品和一个容量为V的背包。第i件物品的费用是c[i]，价值是w[i]。这些物品被划分为若干组，每组中的物品互相冲突，最多选一件。求解将哪些物品装入背包可使这些物品的费用总和不超过背包容量，且价值总和最大。 算法 这个问题变成了每组物品有若干种策略：是选择本组的某一件，还是一件都不选。也就是说设f[k][v]表示前k组物品花费费用v能取得的最大权值，则有： f[k][v]=ma
2014-10-05 15:17:52
755
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人