Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

暴力时间复杂度是对的吧?

Posted by nianheng at 2018-12-14 08:34:51 on Problem 3207
这道题建出来的图中边都是双向而且对称的,根本不用tarjan,用暴力选择尝试扩展的方法,每个点最多只会被遍历一次啊,时间复杂度O(n)?
实测暴力17ms过...

Followed by:

Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator