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 |
原来你把递推方程写在里面了!深表谢意!In Reply To:dp Posted by:Sempr at 2007-01-27 22:11:29 > dp[i+1][j] = Max(dp[i+1][j], dp[i][j]+(i+1)*v[k]); > dp[i+1][j+1] = Max(dp[i+1][j+1], dp[i][j]+(i+1)*v[N-1-j]); Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator