Detail of message

Online Judge

Problem Set

Authors

Online Contests

User

Re:方程如何推?谢谢

Posted by wrong123 at 2006-02-18 21:54:46 on Problem 1260
In Reply To:方程如何推?谢谢 Posted by:bakey at 2005-08-20 20:43:58

Best[i+1]= Min{val*(Sum[i+1]-Sum[j]+10)+Best[j] | 0 <= j <= i}
其中：Best[i]表示经过换买高等级后的最小值。
      Sum[i]:预处理, 表示前i个物品的总数目

Followed by:

Post your reply here: