Submission #865589

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

typedef long long ll;
const ll INF = 1e18;

ll mn[2100][2100];

int main() {
	ll N, x;
	cin >> N >> x;
	vector<ll> a(N);
	for(int i = 0; i < N; i++) cin >> a[i];
	for(int i = 0; i < N; i++)
		for(int j = 0; j < N; j++)
			mn[i][j] = INF;

	for(int i = 0; i < N; i++) {
		for(int j = 0; j < N; j++) {
			if(j == 0)
				mn[i][j] = a[i];
			else
				mn[i][j] = min(a[(i-j+N)%N], mn[i][j-1]);
		}
	}
	ll res = INF;
	for(int i = 0; i < N; i++) {
		ll tmp = 0;
		for(int j = 0; j < N; j++) {
			tmp += mn[j][i];
		}
		tmp += i*x;
		res = min(res, tmp);
	}
	cout << res << endl;
}

Submission Info

Judge Result