BIT2014级软件学院程序设计-22 Treats for the Cows

最新推荐文章于 2019-08-05 22:03:18 发布

原创最新推荐文章于 2019-08-05 22:03:18 发布 · 1.2k 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

2014程序设计小学期专栏收录该内容

22 篇文章

订阅专栏

本文探讨了一位农民如何通过最优策略出售给奶牛的美味零食来最大化收益的问题。通过考虑零食的价值随时间增加而提高的特性，以及不同零食的价值差异，我们提出了一种动态规划的方法来解决这一问题。通过实例分析，展示了如何根据零食价值和年龄定价，以实现最大收益。

Description

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 on day 1 and has age a=1. Each subsequent day increases the age by 1.

Input

Line 1: A single integer, N

Lines 2..N+1: Line i+1 contains the value of treat v(i)

Output

Line 1: The maximum revenue FJ can achieve by selling the treats

Sample Input

Sample Output

Hint

Explanation of the sample:

Five treats. On the first day FJ can sell either treat #1 (value 1) or treat #5 (value 2).

FJ sells the treats (values 1, 3, 1, 5, 2) in the following order of indices: 1, 5, 2, 3, 4, making 1x1 + 2x2 + 3x3 + 4x1 + 5x5 = 43.

也是一道DP的题。每次从头取或者从后取，DP方程也很容易。

#pragma comment(linker, "/STACK:102400000,102400000")
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#define maxn 2500
int dp[maxn][maxn];
int num[maxn];
int max(int a, int b)
{
	if (a > b)
		return a;
	return b;
}
int main()
{
	int n,i,j,flag;
	scanf("%d",&n);
	for (i = 1; i <= n; i++)
		scanf("%d", &num[i]);
	for (i = 1;i <= n;i++)
		dp[i][i] = num[i] * n;
	for (i = 1; i < n;i++)
		for (j = 1; j + i <= n; j++)
		{
			flag = i + j;
			dp[j][flag] = max(dp[j + 1][flag] + (n - i)*num[j], dp[j][flag - 1] + (n - i)*num[flag]);
		}
	printf("%d\n", dp[1][n]);
}