Submission #1691945

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i, a, n) for(ll i = ((ll) a); i < ((ll) n); i++)
using namespace std;
typedef long long ll;

ll N, X, A[2000];

int main(void) {
  cin >> N >> X;
  REP(i, 0, N) cin >> A[i];

  vector< vector<ll> > cost(N, vector<ll>(N));
  REP(i, 0, N) {
    cost[i][0] = A[i];
    REP(j, 1, N) {
      ll cur = (i - j + N) % N;
      cost[i][j] = min(cost[i][j - 1], A[cur]);
    }
  }

  ll ans = (1LL << 60);
  REP(i, 0, N) {
    ll sum = 0;
    REP(j, 0, N) sum += cost[j][i];
    sum += X * i;
    ans = min(ans, sum);
  }
  cout << ans << endl;
}

Submission Info

Judge Result