Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|
Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |
我是这样做的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: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator