제출 #166758

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
166758		theStaticMind	Krov (COCI17_krov)	C++14	0 / 140	1579 ms	3704 KiB

krov

#include<bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define ii pair<int,int>
#define all(x) (x).begin(),(x).end()
#define INF 100000000000000000
#define modulo 1000000007
#define mod 998244353
#define int long long int
using namespace std;

int32_t main(){
      ios_base::sync_with_stdio(false);
      cin.tie(NULL);
   //   freopen("q.gir","r",stdin);
   //   freopen("q.cik","w",stdout);
      int n;
      cin>>n;
      vector<int>arr(n);
      for(int i=0;i<n;i++)cin>>arr[i];
      for(int i=0;i<n;i++)arr[i]--;
      vector<int>L(n,arr[0]);
      vector<int>R(n,arr[0]);
      for(int i=1;i<n;i++){
            L[i]=L[i-1]+arr[i]-i;
            R[i]=R[i-1]+arr[i]+i;
      }
      int ans=INF;
      for(int i=0;i<n;i++){
            long double sum=L[i]+(i+1)+R[n-1]-R[i]-(n-i-1);
            sum=sum/n;
            int mn=max(i,n-i-1);
            int down=sum;
            int up=ceil(sum);
            down=max(down,mn);
            up=max(up,mn);
            int a=0,b=0;
            for(int j=0;j<=i;j++){
                  a+=labs(down-(arr[j]-j+i));
                  b+=labs(up-(arr[j]-j+i));
            }
            for(int j=i+1;j<n;j++){
                  a+=labs(down-(arr[j]+j-i));
                  b+=labs(up-(arr[j]+j-i));
            }
            ans=min(ans,min(a,b));
      }
      cout<<ans;
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 14
• Subtask 3: 0 / 14
• Subtask 4: 0 / 14
• Subtask 5: 0 / 14
• Subtask 6: 0 / 14
• Subtask 7: 0 / 14
• Subtask 8: 0 / 14
• Subtask 9: 0 / 14
• Subtask 10: 0 / 14