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

JAVA到底应该怎么过? DLX和dfs都是TLE,同样的算法,c++就能过

Posted by vanguard001 at 2012-07-14 12:31:19 on Problem 3740
JAVA到底应该怎么过? DLX和dfs都是TLE

首先是使用dfs,java写的tle,然后用c++写一遍通过。
然后试着用java写的DLX,超时,是不是DLX得用数组实现,我是用指针new一堆node,然后指来指去,是不是只有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