Submission #8940332

---

Source Code Expand

#include <bits/stdc++.h>

#define ll long long
#define ff first
#define ss second
#define pb push_back

using namespace std;

const int N = 1e6+69, mod = 1e9+9;

ll n,m,x,y,a,b,c,d,t,k,ans=1e18,cur,l,r,mx;

ll A[N],sum[N];

int main() {
    
   cin>>n;
   for(int i=1;i<=n;i++)
   cin>>A[i],A[i] -= i;
   
   sort(A+1,A+n+1);
   for(int i=1;i<=n;i++)
   sum[i] = sum[i-1] + A[i];
   
   for(int i=1;i<=n;i++){
       b = A[i];
       ans = min(ans,b*i-sum[i]+sum[n]-sum[i]-b*(n-i));
   }
   
   cout<<ans<<endl;
}

Submission Info

Judge Result