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

Re:O(V*Σlog n[i])的复杂度的童鞋应该不行

Posted by Kuroro at 2012-12-02 14:15:03 on Problem 1742
In Reply To:O(V*Σlog n[i])的复杂度的童鞋应该不行 Posted by:kuki at 2010-08-09 18:48:15 
可以过的，O(V*Σlog n[i])同样的写法
自己写的TLE
背包9讲的代码直接敲
ＪＡＶＡ10812K，8938MS，ＡＣ。。。。。。有点不好意思说，太菜了
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