Submission #1358049

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int,int> pint;
typedef vector<pint> vpint;
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=n-1;i>=(0);i--)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
#define all(v) (v).begin(),(v).end()
#define eall(v) unique(all(v), v.end())
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define chmax(a, b) a = (((a)<(b)) ? (b) : (a))
#define chmin(a, b) a = (((a)>(b)) ? (b) : (a))
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll INFF = 1e18;

ll N, x;
ll a[2010];
ll memo[2010];

int main(void) {
	cin >> N >> x;
	rep(i, N) cin >> a[i];

	rep(i, N){
		ll mi = INFF;
		rep(j, N){ // 移動する回数
			ll index = (i - j + N) % N;
			ll d = a[(i - index + N) % N] + index * x;
			// printf("j %d d %lld\n", j, d);
			chmin(mi, d);
		}
		// printf("mi %lld\n", mi);
		memo[i] = mi;
	}

	ll ans = 0;
	rep(i, N) ans += memo[i];
	printf("%lld\n", ans);
	return 0;
}

Submission Info

Judge Result