| ||||||||||
| 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优化(1)-滚动数组简单DP
F[i,j] = Max{ F[i-1,j-1] , F[i-1,j] , F[i-1,j+1] } + W[i,j](i时刻,开门程度j)
F[0,0]=0 F[0,i]= -INF
滚动数组,存储两项
Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator