Untitled

#include<bits/stdc++.h>
#define lli long long int

using namespace std;

const int MAXN = 1010, K = 25;

int lg[MAXN+1];
int st[K + 1][MAXN];

int getMaxVal(int L, int R) {
    int i = lg[R - L + 1];
    return max(st[i][L], st[i][R - (1 << i) + 1]);
}

void solve() {
    int N;
    cin >> N;
    vector<int> v(N);
    for (int i = 0; i < N; i++) {
        cin >> v[i];
    }
    std::copy(v.begin(), v.end(), st[0]);
    for (int i = 1; i <= K; i++) {
        for (int j = 0; j + (1 << i) <= N; j++) {
            st[i][j] = max(st[i - 1][j], st[i - 1][j + (1 << (i - 1))]);
        }
    }
    lli dp[N + 10][N + 10];
    for (int l = 1; l <= N; l++) {
        for (int i = 0; i <= N - l; i++) {
            int j = i + l - 1;
            int turn = N - l + 1;
            if (i == j) {
                dp[i][j] = turn * 1LL * v[i] + v[i];
                continue;
            }
            lli a = dp[i + 1][j] + turn * 1LL * v[i] + getMaxVal(i, j);
            lli b = dp[i][j - 1] + turn * 1LL * v[j] + getMaxVal(i, j);
            dp[i][j] = max(a, b);
        }
    }
    cout << dp[0][N - 1] << '\n';
}

int main() {
    lg[1] = 0;
    for (int i = 2; i <= MAXN; i++)
        lg[i] = lg[i/2] + 1;
    int te;
    cin >> te;
    while (te--) {
        solve();
    }
}