Submission #866198

---

Source Code Expand

#include <iostream>
#include <algorithm>
using namespace std;
int dp[2000][2000];

int main(){
    int N,x;
    cin>>N>>x;
    for(int i=0;i<N;i++){
        cin>>dp[i][0];
    }
    for(int k=1;k<N;k++){
        for(int i=0;i<N;i++){
            dp[i][k]=min(dp[i][k-1],dp[(i-1+N)%N][k-1]);
        }
    }
    long long int ans=1LL<<60;
    for(int k=0;k<N;k++){
        long long int sum=0;
        for(int i=0;i<N;i++){
            sum+=dp[i][k];
        }
        sum+=k*x;
        ans=min(ans,sum);
    }
    cout<<ans<<endl;
    return 0;
}

Submission Info

Judge Result