 |
| ||||
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 | |||||||||
dpIn Reply To:感觉自己程序是实现了想到的方法的，但是WA了，可能是方法错了！各位是怎么做的? Posted by:nuciedh at 2007-01-27 22:09:12 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
