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

其实这题有O(n)解法

Posted by icool123 at 2012-05-24 12:20:39 on Problem 1848
RT
但那些0ms的O(n^2)让32ms的O(n)情何以堪!!!
具体的解题报告还欠缺一些严谨证明,晚些时候再贴。主要思路是对节点进行分类,而O(n^2)算法则没有利用这一性质。
继续努力!!!

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