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 onlyxuyang at 2010-07-16 12:11:46 on Problem 2411
In Reply To:这道题目,太恶心啦,到底怎么dp Posted by:55 at 2008-11-15 15:15:49
我是做的很囧来着
就是合适的hash函数试了好半天
用个map存储当前数组的hash值和对应的方案数
每一步寻找第一个没被占用的空格做横放和竖放两种考虑
就行....
主要是能保持不发生冲突的数组的hash好难找
试了好半天
才勉强试出一个.....

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