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

扩展1，找到所有和1相连的，然后扩展这些节点，然后再找新增的和1相连的，直到找不到……

Posted by ACM06Louty at 2008-09-29 20:09:08
In Reply To:这样都能过?大牛你怎么硬搞的啊？ Posted by:doommetal at 2008-09-29 20:07:28

Followed by:

BFS??? (0) doommetal 2008-09-29 20:13:39
- 恩 (0) ACM06Louty 2008-09-29 20:17:12
  - 俺们队dfs挂掉....TT (0) doommetal 2008-09-29 20:20:44
ACM06Louty 请问大牛，这样硬搞多少秒过？ (0) toliuweijing 2008-09-29 21:06:17
- 同问 (0) Asea 2008-09-29 21:08:32
- 0.26好像…… (0) ACM06Louty 2008-09-29 21:32:05
这样是n^2吧居然也能过？我们都不敢写 (0) TheBeet 2008-09-29 21:10:10
- 想想其实并不是n^2的，查找虽然是n，但是如果数据造得让你查找是n，那么需要浪费n条边，最差的想法，查找一个新增的节点需要多少次，就需要浪费同样的边数才能做到。 (0) ACM06Louty 2008-09-29 21:33:44

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