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 dreamfox at 2011-10-09 14:14:37 on Problem 3254
In Reply To:难道是数据弱?(2^12)^2*12的状态DP都过- -||| 哪位大大指教下简单点的方法么? Posted by:masque at 2009-07-16 13:56:41
最坏情况,也就是所有都是1,12*12的情况。
用dfs的话,也就是12*2^6*2^12而已。因为同一行不能有两个1相邻的。

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