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

再次求助, 我只能想到一个剪枝的方法

Posted by sunmoonstar at 2006-05-15 21:15:17 on Problem 1084
In Reply To:能过 5 0 的同学, 请介绍一下剪枝方法, 我的4 0 就超 1 s, 5 0 就根本算不出了,谢谢 Posted by:sunmoonstar at 2006-05-14 00:27:42
超时,我是按 match 搜的 
用迭代 dfs 
只用了一个剪枝:
如果当前考虑的以及以后将要考虑的 match  
不能破坏前面的一些 方格 就不用继续了 
 
请教 优化方法

或者说, 我搜的方式就不容易剪枝?

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