 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| 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 | |||||||||
Re:n*n*m的复杂度啊。不会超？In Reply To:Re:说说你的思路吧 Posted by:200609020331 at 2008-12-28 20:48:26 > 用BFS对图进行遍历的，比如有四个顶点的图 看1->3有几条不同的路径，遍历过的路径就标志遍历过，以后就不能再被遍历了，直到从1不能遍历到3为止。如此对图的每对顶点进行这样的处理，如果每对顶点的不同路径都>=3则"YES"否则“No"， Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
