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

F我还再能想到的就是枚举双连通中的最短边，以及缩图后用DP来解树的Case，不知道教主的想法是？？

Posted by richardxx at 2007-11-06 22:03:37
In Reply To:还活着 Posted by:wywcgs at 2007-11-06 15:29:34

rt

Followed by:

暂时没啥想法 (116) wywcgs 2007-11-06 22:12:43
我想折腾最短路树…… (6) frkstyc 2007-11-06 22:28:39
- BT的想法想一想就够了…… (38) wywcgs 2007-11-06 22:37:45
- 的确是最短路树 (22) Mithril 2007-11-06 23:00:21
  - o? thx...... (26) wywcgs 2007-11-06 23:01:39
  - 能不能说一下用spt怎么搞搞？？ (26) richardxx 2007-11-06 23:01:55
  - 最短路树能搞到什么复杂度？ (26) wywcgs 2007-11-06 23:02:05
    - n^3logM (0) Mithril 2007-11-06 23:02:59
      - 我想想，多谢 (0) wywcgs 2007-11-06 23:03:36

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