 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| 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 | |||||||||
简单的DP O(N)dp[i][j][k],i表示位置，j有4种状态:0.火柴没有动，1.拿走1根火柴，2.拿来1根火柴，3.拿走1根火柴并放在之前的位置上，k表示是否进位，剩下就是状态转移乱搞，有点麻烦，不知道2K+的代码是肿么写出来的。。。。。 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
