Submission #3780068

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cmath>
#include <iomanip>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cassert>
#include <cstring>

using namespace std;

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())

typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> V;
typedef map<int, int> M;

constexpr ll INF = 1e18;
constexpr ll MOD = 1e9 + 7;
constexpr double PI = 3.14159265358979323846;
constexpr int dx[] = {0, 0, 1, -1};
constexpr int dy[] = {1, -1, 0, 0};

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int N;
    ll x, a[2123], b[2123];

    cin >> N >> x;
    REP(i, N)
    {
        cin >> a[i];
        b[i] = a[i];
    }

    ll res = __LONG_LONG_MAX__;

    for (int i = 0; i < N; i++)
    {
        ll tmp = x * i;

        REP(j, N)
        {
            b[j] = min(b[j], a[(j - i + N) % N]);
            tmp += b[j];
        }

        res = min(res, tmp);
    }

    cout << res << endl;

    return 0;
}

Submission Info

Judge Result