Submission #1816740

---

Source Code Expand

// B. 

#include <iostream>
#include <algorithm>
#include <numeric>
#include <vector>
#include <cstdio>
#include <cstring>

using namespace std;
typedef long long LL;

int main(int argc, char *argv[])
{
	LL N, x, ans = 1LL << 60;
	cin >> N >> x;
	vector<LL> a(N);
	for (LL i = 0; i < N; ++i) {
		cin >> a[i];
	}
	for (LL i = 0; i < N; ++i) {
		vector<LL> b = a;
		for (LL j = 0; j < N; ++j) {
			int k = (j - i + N) % N;
			b[j] = min(a[j], a[k]);
		}
		LL sum = accumulate(b.begin(), b.end(), x * i);
		ans = min(ans, sum);
		a = b;
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result