Submission #3012879

---

Source Code Expand

#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <fstream>
#include <sstream>
#include <set>
#include <map>
#include <vector>
#include <list>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <string>
#include <queue>
#include <bitset>     //UWAGA - w czasie kompilacji musi byc znany rozmiar wektora - nie mozna go zmienic
#include <cassert>
#include <iomanip>        //do setprecision
#include <ctime>
#include <complex>
using namespace std;

#define FOR(i,b,e) for(int i=(b);i<(e);++i)
#define FORQ(i,b,e) for(int i=(b);i<=(e);++i)
#define FORD(i,b,e) for(int i=(b)-1;i>=(e);--i)
#define REP(x, n) for(int x = 0; x < (n); ++x)

#define ST first
#define ND second
#define PB push_back
#define MP make_pair
#define LL long long
#define ULL unsigned LL
#define LD long double

const double pi = 3.141592653589793238462643383279502884197169399375105820974944592307816406286208998628034825342;
const int mod=1000000007;

int main(){
	LL n,x,a[2222]={},m[2222]={},m2[2222]={};
	cin>>n>>x;
	FOR(i,0,n){
		cin>>a[i];
		m[i]=a[i];
	}

	LL ans=1LL*mod*mod;
	FOR(nx,0,n){
		LL tmp=nx*x;
		FOR(j,0,n){
			m[j]=min(m[j],a[(j+n-nx)%n]);
			tmp+=m[j];
		}
		ans=min(ans,tmp);
	}
	cout<<ans;

    return 0;
}

Submission Info

Judge Result