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 flymouse at 2006-10-21 22:17:07
In Reply To:求助, 上海网络赛A怎么做??? Posted by:howie at 2006-10-21 22:11:36

Followed by:

不打表在线算貌似也可以在1s内搞出来 (0) wywcgs 2006-10-21 22:19:14
- 怎么做的？？ (0) flymouse 2006-10-21 22:19:43
  - 当然还是最小路径覆盖，还能怎么做 - - (0) wywcgs 2006-10-21 22:20:29
    - 难道您是M*SQRT(N)的二分匹配么？ (0) flymouse 2006-10-21 22:43:32
      - Re:边数不多，邻接表存图直接匹配还是挺快的~ (0) MrRight 2006-10-21 22:47:52
      - 就是普通的匹配，还打的邻接矩阵，查找用二分...... (39) wywcgs 2006-10-21 22:48:47
倒,刚好没看到这页,晕,唉,其实RP真的很重要 (0) lcftc 2006-10-21 22:21:01
- 刚刚才说的。。。 (0) flymouse 2006-10-21 22:21:24

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