Submission #1838471

---

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];

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];
  }

  int maxX=0;
  
  for(int i=0;i<n;i++)
    
    for(int j=0;j<n;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);
      }
  
    
  int ans=maxX;
  
  for(int i=0;i<n;i++) ans+=A[i].second;
  
  cout<<ans<<endl;
  
  return 0;
}

Submission Info

Judge Result