E - Treats for the Cows

最新推荐文章于 2021-03-25 07:03:07 发布

Yo3ngLau

最新推荐文章于 2021-03-25 07:03:07 发布

阅读量80

点赞数

分类专栏：动态规划

本文链接：https://blog.csdn.net/weixin_43359312/article/details/102311190

版权

动态规划专栏收录该内容

15 篇文章 0 订阅

订阅专栏

E - Treats for the Cows

题目入口：https://vjudge.net/contest/330469#problem/E
POJ入口：Treats for the Cows

AC代码

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
typedef long long LL;
#define inf 0x3f3f3f3f
#define mm(a) memset(a, 0, sizeof(a))
const int MAXN = 2019;
int dp[MAXN][MAXN], val[MAXN];
int main() {
    int n;
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) scanf("%d", &val[i]);
    dp[0][0] = 0;
    for (int i = 1; i <= n; i++) dp[i][0] = val[i]*i + dp[i-1][0];
    for (int j = 1; j <= n; j++) dp[0][j] = val[n-j+1]*j + dp[0][j-1];
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n-i; j++)
            dp[i][j] = max(dp[i-1][j]+val[i]*(i+j), dp[i][j-1]+val[n-j+1]*(i+j));
    int Max = 0;
    for (int i = 0; i <= n; i++) Max = max(Max, dp[i][n-i]);
    printf("%d\n", Max);
    return 0;
}