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

是吗？可以稍微讲一下啵？

Posted by alpc16 at 2007-08-14 19:28:13 on Problem 3342
In Reply To:这个TreeDp很简单的 Posted by:nuanran at 2007-08-14 19:15:43

Followed by:

Re:是吗？可以稍微讲一下啵？ (175) whitesea 2007-08-14 21:44:08
- Re:是吗？可以稍微讲一下啵？ (223) whitesea 2007-08-15 10:51:49
Re:我的做法是这样的... ... (350) Thank_you 2007-08-15 10:32:58
- 应该是f[i][0]=max(f[j][0],f[j][1])+max(f[k][0],f[k][1]).....吧？ (570) alpc16 2007-08-15 11:45:46
  - Re:应该是f[i][0]=max(f[j][0],f[j][1])+max(f[k][0],f[k][1]).....吧？ (660) Thank_you 2007-08-15 12:27:14
    - 如果这样的话，那求f[i][0]的时候就不是简单最大值相加了，若碰上相等的情况则两者都要加上吧？ (78) alpc16 2007-08-15 12:32:40
      - 终于AC了，实际上还是只要加一个的。。。。 (55) alpc16 2007-08-15 15:51:27

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