Submission #1511723

---

Source Code Expand

#include <algorithm>
#include <numeric>
#include <numeric>
#include <complex>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (lli i = 0; i < (n); i++)
#define rrep(i, n) for (lli i = (n)-1; i >= 0; i--)
using namespace std;
using lli = long long int;


lli dp[2005][2005] = {};
int main()
{
    lli n, x, a[2005];
    cin >> n >> x;
    rep(i, n) cin >> a[i];
    lli INF = 1e18;
    rep(i, 2005) rep(j, 2005) dp[i][j] = INF;
    rep(i, 2005) dp[i][0] = a[i];
    rep(i, n) rep(j, n)
    {
        dp[i][j + 1] = min(dp[i][j], a[(i - j - 1 + n) % n]);
    }
    lli ans = 1e18;
    rep(j, n + 1)
    {

        lli sum = 0;
        rep(i, n) sum += dp[i][j];
        ans = min(sum + j * x, ans);
    }
    cout << ans << endl;
}

Submission Info

Judge Result