Submission #1350346

---

Source Code Expand

#pragma region include
#include <iostream>
#include <iomanip>
#include <stdio.h>

#include <sstream>
#include <algorithm>
#include <cmath>
#include <complex>

#include <string>
#include <cstring>
#include <vector>
#include <tuple>
#include <bitset>

#include <queue>
#include <complex>
#include <set>
#include <map>
#include <stack>
#include <list>

#include <fstream>
#include <random>
//#include <time.h>
#include <ctime>
#pragma endregion //#include
/////////
#define REP(i, x, n) for(int i = x; i < n; ++i)
#define rep(i,n) REP(i,0,n)
/////////
#pragma region typedef
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
#pragma endregion //typedef
////定数
const int INF = (int)1e9;
const LL MOD = (LL)1e9+7;
const LL LINF = (LL)1e18;
const double PI = acos(-1.0);
const double EPS = 1e-9;
/////////
using namespace::std;

void solve(){
	int N;
	LL X;
	cin >> N >> X;
	vector<LL> A(N);
	for(int i=0;i<N;++i){
		cin >> A[i];
	}
	/////
	vector<LL> org(N);//iを得るための元
	vector<LL> time(N,0);//iに変えるXの回数
	for(int i=0;i<N;++i){
		LL res = LINF;//iを得るための最短時間
		LL num = i;//iを得るための元
		LL Xnum = 0;//色変化回数
		for(int x=0;x<N;++x){//xも小さいほうが良い
			LL No = (i-x+N)%N;//元
			LL temp = A[No] + x* X;
			if( temp < res ){
				res = temp;
				num = No;
				Xnum = x;
			}
		}
		org[i] = num;
		time[i] = Xnum;
	}
	LL ans = 0;
	LL maxX = 0;
	for(int i=0;i<N;++i){
		ans += A[ org[i] ];
		maxX = max(maxX,time[i]);
	}
	ans = ans + maxX * X;
	cout << ans << endl;
}

#pragma region main
signed main(void){
	std::cin.tie(0);
	std::ios::sync_with_stdio(false);
	std::cout << std::fixed;//小数を10進数表示
	cout << setprecision(16);//小数点以下の桁数を指定//coutとcerrで別	
	
	solve();
}
#pragma endregion //main()

Submission Info

Judge Result