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:敢问这道题的数据有多少啊，怎么n*log(n)的复杂度也TLE呀？

Posted by Los_Angelos_Laycurse at 2012-11-04 22:29:25 on Problem 3108
In Reply To:敢问这道题的数据有多少啊，怎么n*log(n)的复杂度也TLE呀？ Posted by:Los_Angelos_Laycurse at 2012-11-04 22:22:08 
> RT
这道题太变态了，变量都不知道怎么存，一个变量最大的字符长度19994，而horn_clause 的个数上限大约5000，是不是因为我开了 [5000][19995]的数组TLE了？求大牛解释啊，太坑了
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