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 |
Re:这道题目,太恶心啦,到底怎么dpIn Reply To:这道题目,太恶心啦,到底怎么dp Posted by:55 at 2008-11-15 15:15:49 我是做的很囧来着 就是合适的hash函数试了好半天 用个map存储当前数组的hash值和对应的方案数 每一步寻找第一个没被占用的空格做横放和竖放两种考虑 就行.... 主要是能保持不发生冲突的数组的hash好难找 试了好半天 才勉强试出一个..... Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator