 |
| ||||
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 | |||||||||
原来高手都用滚动数组卡内存，一直没想到，只会傻呵呵地m*n的矩阵数表，又学到了In Reply To:就是p[n][i]=min(p[n-1][i+d],p[n][i-1])+f啊，d是前后两站的距离，f是钱，然后滚动数组就行了 Posted by:frkstyc at 2005-07-11 00:43:54 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
