Problem p02709 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
using namespace std;

// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long long)(n)); i > 0; i--)
#define irep(i, m, n)                                                          \
  for (long long i = (long long)(m); i < (long long)(n); ++i)
#define ireps(i, m, n)                                                         \
  for (long long i = (long long)(m); i <= (long long)(n); ++i)
#define SORT(v, n) sort(v, v + n);
#define REVERSE(v, n) reverse(v, v + n);
#define vsort(v) sort(v.begin(), v.end());
#define all(v) v.begin(), v.end()
#define mp(n, m) make_pair(n, m);
#define cout(d) cout << d << endl;
#define coutd(d) cout << std::setprecision(10) << d << endl;
#define cinline(n) getline(cin, n);
#define replace_all(s, b, a) replace(s.begin(), s.end(), b, a);
#define PI (acos(-1))
#define FILL(v, n, x) fill(v, v + n, x);
#define sz(x) long long(x.size())

using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vs = vector<string>;
using vpll = vector<pair<ll, ll>>;
using vtp = vector<tuple<ll, ll, ll>>;
using vb = vector<bool>;

template <class T> inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}

const ll INF = 1e15;
const ll MOD = 1e9 + 7;
const ll LINF = 1e18;

ll dp[2005][2005];

signed main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  ll n;
  cin >> n;
  vpll v(n);
  rep(i, n) {
    cin >> v[i].first;
    v[i].second = i;
  }
  vsort(v);
  for (ll l = 0; l <= n; l++) {
    for (ll r = n; r >= l; r--) {
      ll idx = r - l;
      if (l > 0) {
        ll tmp = dp[l - 1][r];
        tmp += abs((l - 1) - v[idx].second) * v[idx].first;
        chmax(dp[l][r], tmp);
      }
      if (r < n) {
        ll tmp = dp[l][r + 1];
        tmp += abs(r - v[idx].second) * v[idx].first;
        chmax(dp[l][r], tmp);
      }
      cerr << l << " " << r << " " << idx << " " << dp[l][r] << endl;
    }
  }
  ll ans = 0;
  for (ll i = 0; i <= n; i++) {
    chmax(ans, dp[i][i]);
  }
  cout << ans << endl;
}

Fixed submission:
#include <bits/stdc++.h>
using namespace std;

// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long long)(n)); i > 0; i--)
#define irep(i, m, n)                                                          \
  for (long long i = (long long)(m); i < (long long)(n); ++i)
#define ireps(i, m, n)                                                         \
  for (long long i = (long long)(m); i <= (long long)(n); ++i)
#define SORT(v, n) sort(v, v + n);
#define REVERSE(v, n) reverse(v, v + n);
#define vsort(v) sort(v.begin(), v.end());
#define all(v) v.begin(), v.end()
#define mp(n, m) make_pair(n, m);
#define cout(d) cout << d << endl;
#define coutd(d) cout << std::setprecision(10) << d << endl;
#define cinline(n) getline(cin, n);
#define replace_all(s, b, a) replace(s.begin(), s.end(), b, a);
#define PI (acos(-1))
#define FILL(v, n, x) fill(v, v + n, x);
#define sz(x) long long(x.size())

using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vs = vector<string>;
using vpll = vector<pair<ll, ll>>;
using vtp = vector<tuple<ll, ll, ll>>;
using vb = vector<bool>;

template <class T> inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}

const ll INF = 1e15;
const ll MOD = 1e9 + 7;
const ll LINF = 1e18;

ll dp[2005][2005];

signed main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  ll n;
  cin >> n;
  vpll v(n);
  rep(i, n) {
    cin >> v[i].first;
    v[i].second = i;
  }
  vsort(v);
  for (ll l = 0; l <= n; l++) {
    for (ll r = n; r >= l; r--) {
      ll idx = r - l;
      if (l > 0) {
        ll tmp = dp[l - 1][r];
        tmp += abs((l - 1) - v[idx].second) * v[idx].first;
        chmax(dp[l][r], tmp);
      }
      if (r < n) {
        ll tmp = dp[l][r + 1];
        tmp += abs(r - v[idx].second) * v[idx].first;
        chmax(dp[l][r], tmp);
      }
      // cerr << l << " " << r << " " << idx << " " << dp[l][r] << endl;
    }
  }
  ll ans = 0;
  for (ll i = 0; i <= n; i++) {
    chmax(ans, dp[i][i]);
  }
  cout << ans << endl;
}