Submission #12131467

---

Source Code Expand

#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<ll, int> P;

int main()
{
    int n;
    cin>>n;
    vector<P> va(n);
    ll a[2020];
    for(int i=0; i<n; i++) cin>>a[i];
    for(int i=0; i<n; i++) va[i]=P(a[i], i);
    sort(va.begin(), va.end(), greater<P>());
    ll dp[2020][2020];
    for(int i=0; i<=n; i++) for(int j=0; j<=n-i; j++) dp[i][j]=-1e18;
    dp[0][0]=0;
    for(int i=0; i<=n; i++){
        for(int j=0; j<n-i; j++){
            ll a1=va[i+j].first, k=va[i+j].second;
            dp[i+1][j]=max(dp[i+1][j], abs(i-k)*a1+dp[i][j]);
            dp[i][j+1]=max(dp[i][j+1], abs(n-j-1-k)*a1+dp[i][j]);
        }
    }
    ll ans=-1e18;
    for(int i=0; i<=n; i++) ans=max(ans, dp[i][n-i]);
    cout<<ans<<endl;
	return 0;
}

Submission Info

Judge Result