 |
| ||||
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 | |||||||||
本以为会超时，结果跑了219ms，happy~~~dfs求出每一行的状态，最多一行的状态是60中，算不出的可以用10个p跑一下看看~ dp[i][j][k] = dp[i-1][k][t] + rowcount[i][j] dp[i][j][k] 表示第i行选择状态为j， i-1行为k状态 rowcount[i][j] 表示 第i行选择j状态时，此行炮兵的个数 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
