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 limingfei at 2007-10-10 11:11:13 on Problem 3420
In Reply To:这题递推式是什么 Posted by:z12y12l12 at 2007-10-06 15:19:40
用状态压缩的dp的方式,每个n有16种情况,这些都能从n - 1的那16种情况推过来,比如
f(n, 14) = f(n - 1, 1) + f(n - 1, 7) + f(n - 1, 13)
然后把每个都求出来,从f(n - 1)到f(n)就只用左乘一个16x16的方阵了。

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