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(N^3logk)要超时，错误先来不及看

Posted by a024014 at 2007-03-22 19:14:50 on Problem 3150
In Reply To:你的时间复杂度太高，O(N^3logk)要超时，错误先来不及看 Posted by:YUMEN19850720 at 2007-03-22 13:35:43 
谢谢前辈的回复!
我的算法利用了矩阵乘法,复杂度就升到了o*(n^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