Submission #47828446

---

Source Code Expand

#include<bits/stdc++.h>
#define ll long long
#define db double
#define ull unsigned long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define FR first
#define SE second
#define int long long
using namespace std;
inline int read() {
  int x = 0; bool op = false;
  char c = getchar();
  while(!isdigit(c))op |= (c == '-'), c = getchar();
  while(isdigit(c))x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();
  return op ? -x : x;
}
bool chkmin(int &a, int b) {return (b < a ? a = b, true : false);}
const int N = 110;
const int INF = 1e18;
int n, k;
int c[N], pos[N], f[N][N][N];
signed main() {
  n = read(); k = read();
  for(int i = 1; i <= k; i++)c[i] = read();
  for(int i = 1; i <= n; i++)pos[read()] = i;
  for(int i = 0; i <= k; i++) {
    for(int l = 1; l <= n; l++) {
      for(int r = l; r <= n; r++) {
        f[i][l][r] = INF;
      }
    }
  }
  for(int l = 1; l <= n; l++) {
    for(int r = l; r <= n; r++) {
      f[k][l][r] = 0;
      if(r == n || pos[r] > pos[r + 1])break;
    }
  }
  for(int i = k; i; i--) {
    for(int l = 1; l <= n; l++) {
      for(int r = l; r <= n; r++) {
        chkmin(f[i - 1][l][r], f[i][l][r]);
        for(int x = l; x < r; x++) {
          chkmin(f[i - 1][l][r], f[i][l][x] + f[i][x + 1][r] + c[i] * (r - x));
        }
      }
    }
  }
  printf("%lld\n", (f[0][1][n] == INF ? -1 : f[0][1][n]));
  return 0;
}

Submission Info

Judge Result