 怎么优化呀? (25) tigerhy1 2005-09-19 10:45:22 Problem 2047
- 200题留念 留个程序哈 (1149) 737566563 2013-01-19 14:41:59 Problem 2047
- 不了解a single integer n的范围是多大啊，为啥偶把数组开成1都能过~优质dp留爪 (514) rayafjyblue 2011-07-25 10:55:02 Problem 2047
- 表示DP写乱了，被逼着写了MCMF，结果0ms，果然是DP走到头后还是费用流王道啊 (4) dut200901102 2011-05-28 22:38:45 Problem 2047
- 比较水，倒推，f[i,j] i<=j 从j推下一个状态，相等时特殊判断O(N2) (0) imbeta 2011-05-02 16:22:36 Problem 2047
- 费用流……水过…… (2) skywalker_q 2011-04-18 19:39:15 Problem 2047
- I'm too lazy to think an efficient DP solution. Just solved it using maxcost-maxflow. (0) applepi 2011-04-08 13:21:06 Problem 2047
- 大胆使用动态规划好了,这题数据很弱,没有必要担心会超时 (0) zsasuke 2008-11-28 17:08:41 Problem 2047
- 这道题好假啊,3方到2方,假~!!~!~~!~!想了几天,想到了..... (0) czh 2007-04-27 20:20:29 Problem 2047
- 多谢大家的提醒,终于搞明白了,如果让我自己从头想到几乎是不可能 (0) cx19860824 2007-04-26 10:46:07 Problem 2047
- 我用DP,但TLE,不知道用DP怎么优化呀? (0) tigerhy1 2005-09-19 20:17:11 Problem 2047
|
