Submission #1838481

---

Source Code Expand

#include<bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int,int> P;

int n, x, a[2005];
P A[2005], B[2005];

signed main(){
  
  cin>>n>>x;

  for(int i=0;i<n;i++){
    cin>>a[i];
    A[i].first=a[i];
    A[i].second=a[i];
    B[i]=A[i];
  }
  
  int Ans=(1e15);
  
  for(int t=0;t<=n;t++){

    for(int i=0;i<n;i++) A[i]=B[i];
    
    int maxX=0;
    
    for(int i=0;i<n;i++)
      
      for(int j=0;j<t;j++)
	if(A[(i+j)%n].first>a[i]+j*x){
	  A[(i+j)%n].first=a[i]+j*x;
	  A[(i+j)%n].second=a[i];
	  maxX=max(maxX, j*x);
	}else if(A[(i+j)%n].first==a[i]+j*x)
	  if(A[(i+j)%n].second>a[i]) A[(i+j)%n].second=a[i];
    
    int ans=maxX;
    
    for(int i=0;i<n;i++) ans+=A[i].second;
    
    Ans=min(Ans, ans);
  }
  
  cout<<Ans<<endl;
  
  return 0;
}

Submission Info

Judge Result