洛谷 P2858 [USACO06FEB]奶牛零食Treats for the Cows

最新推荐文章于 2023-02-17 19:08:26 发布

ACautomata

最新推荐文章于 2023-02-17 19:08:26 发布

阅读量213

点赞数

分类专栏：洛谷USACO之旅

本文链接：https://blog.csdn.net/weixin_43913349/article/details/87551364

版权

约翰购买了编号1到N的零食，零食会随着时间推移升值，编号i的零食初始价值为v(i)，在第a天出售价值为v(i)*a。他每天从盒子一端取出一个零食，如何安排销售顺序以获得最大收益？此问题涉及区间DP，通过二维数组dp[i][j]表示从i到j的最大收益，求解最优策略。

摘要由CSDN通过智能技术生成

题目描述
FJ has purchased N (1 <= N <= 2000) yummy treats for the cows who get money for giving vast amounts of milk. FJ sells one treat per day and wants to maximize the money he receives over a given period time.

The treats are interesting for many reasons:The treats are numbered 1…N and stored sequentially in single file in a long box that is open at both ends. On any day, FJ can retrieve one treat from either end of his stash of treats.Like fine wines and delicious cheeses, the treats improve with age and command greater prices.The treats are not uniform: some are better and have higher intrinsic value. Treat i has value v(i) (1 <= v(i) <= 1000).Cows pay more for treats that have aged longer: a cow will pay v(i)*a for a treat of age a.Given the values v(i) of each of the treats lined up in order of the index i in their box, what is the greatest value FJ can receive for them if he orders their sale optimally?

The first treat is sold o