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

恩，受教了，期待loard wu有一天能带着O(n^3)回POJ发贴。。

Posted by richardxx at 2007-10-23 15:48:29 on Problem 3422
In Reply To:我也很想知道是怎么实现的…… Posted by:wywcgs at 2007-10-23 15:06:58 
> 我只知道朴素的primal-dual肯定分析不出O(V^3)的复杂度……
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