Detail of message

Online Judge

Problem Set

Authors

Online Contests

User

Web Board
Home Page
F.A.Qs
Statistical Charts

Current Contest
Past Contests
Scheduled Contests
Award Contest

这道题DP用什么状态？f[i][j]表示用i块M巧克力装前j个盒子的最多数量，最后对枚举一次，找出L巧克力可以补足其它盒子时的最大值，但是这路径怎么存？

Posted by sunmoonstar_love at 2005-07-12 12:42:11 on Problem 1293

Followed by:

这个Special Judge是不是还没写好啊？怎么zju的过了，pku的WA啊？ (0) champoier 2005-07-15 17:06:21
- 估计hawk还没开始写 (0) frkstyc 2005-07-15 17:07:51
  - 忘了，我尽快 (0) hawk 2005-07-15 17:10:42
    - busy hawk,hehe (0) frkstyc 2005-07-15 17:11:35
- How soon will hawk have written Special Judge? (0) champoier 2005-07-18 11:26:57
  - hawk 够忙了，每周要找几十道题，等等吧，先去ZOJ过 (0) sunmoonstar_love 2005-07-18 11:48:26
    - 每周要找几十道题?加到pku上吗？ (0) champoier 2005-07-18 16:41:43
      - 我感觉找题不是那么容易的，每周要找20++题 (0) sunmoonstar_love 2005-07-18 16:48:36
  - 今晚有时间我就写一下，如果不忘记了的话；） (0) hawk 2005-07-18 16:55:55
    - hawk可以找个办法鼓励大家来写…… (25) xiedi 2005-07-19 13:06:41
      - 主要这个不容易写，要很稳定，对于用户的任何输出，spj本身绝对不能出错 (27) hawk 2005-07-19 17:11:11
    - hawk又忘记了…… (0) frkstyc 2005-07-19 13:07:22
      - 好了，写完了才发现它自己原来就有，sigh (11) hawk 2005-07-19 17:10:42

Post your reply here:

Home Page Go Back To top

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator