Educational Codeforces Round 108 (Rated for Div. 2) D. Maximum Sum of Products（简单dp）

题意：给a、b两个数组，可以将数组a的一段连续子序列反转，求  的最大值

思路： 定义为数组a反转[i, j]区间后，这段区间对应位置的乘积之和，有转移方程：

预处理乘积的前缀和，然后n ^ 2取最大值即可

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 5007;
const int M = 2e6 + 7;
const int inf = 0x3f3f3f3f;
const int mod = 1e9 + 7;

ll a[N], b[N], pre[N], dp[N][N];

int main() {
    int n;
    scanf("%d", &n);
    for(int i = 1; i <= n; ++i) scanf("%lld", &a[i]);
    for(int i = 1; i <= n; ++i) scanf("%lld", &b[i]);
    pre[0] = 0;
    for(int i = 1; i <= n; ++i) pre[i] = pre[i - 1] + a[i] * b[i];
    ll maxx = pre[n];
    memset(dp, 0, sizeof(dp));
    for(int i = n; i >= 1; --i) {
        dp[i][i] = a[i] * b[i];
        for(int j = i + 1; j <= n; ++j) {
            dp[i][j] = dp[i + 1][j - 1] + a[i] * b[j] + a[j] * b[i];
        }
    }
    for(int l = 1; l <= n; ++l)
        for(int r = l + 1; r <= n; ++r)
            maxx = max(maxx, pre[l - 1] + dp[l][r] + pre[n] - pre[r]);
    printf("%lld\n", maxx);
    return 0;
}