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

Re:DP解题思路:

Posted by tasty at 2016-05-06 08:46:25 on Problem 1071
In Reply To:DP解题思路: Posted by:alpc56 at 2009-08-23 16:46:00
> 按照chase[N-1]到chase[0] DP
> for(k=n-1;k>=0;k--)
> dp[i][j](bool) 表示点坐标(i,j)作为完成后k个chase的起点的可行性
> DP完chase[0] 检查dp[][]得到可行解的个数就OK了
> 真不明白搜索是怎么写得?
三维状态没有爆掉 10000K 内存?  最好还是二维吧。。。

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