Detail of message

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

就是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 on Problem 2465
In Reply To:能教教我，平方的么，现在写DP都只会立方的 Posted by:sunmoonstar_love at 2005-07-11 00:41:04

Followed by:

原来高手都用滚动数组卡内存，一直没想到，只会傻呵呵地m*n的矩阵数表，又学到了 (0) sunmoonstar_love 2005-07-11 00:50:11
- 之前好几次用滚动数组都砍掉2/3的时间，递推式简单的时候就这么写了，复杂的还是先大数组过了再说 (0) c0500448264 2005-07-11 00:52:45
P[n][i]是到第n站，油为i时的最少费用，对f不是很明白，f = pri[n]？那方程是不是p[n][i]=min(p[n-1][i+d],p[n][i-1]+pri[i]) (0) sunmoonstar_love 2005-07-11 01:06:25
- f是一litre油要被油站抢劫多少，p是跑到第n个站之后剩i那么多油要多少钱 (0) frkstyc 2005-07-11 01:08:09
  - 前面抄错了 (0) frkstyc 2005-07-11 01:08:55
  - 谢谢你 (0) sunmoonstar_love 2005-07-11 01:10:29
- p[n][i]=min(p[n-1][i+d],p[n][i-1]+pri[i]) (19) luoyudong 2010-03-23 21:08:29

Post your reply here:

Home Page Go Back To top

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator