Submission #5882797

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
 
#define REP(i,n) for(int i=0; i < (n); ++i)
#define REPR(i,n) for(int i=(n); i >=0; --i)
#define FOR(i, m, n) for(int i = (m); i < (n); ++i)
 
typedef long long ll;
#define INF 1e9


int main(){
  int N, K;
  cin >> N >> K;
  vector<int> A(N);
  int mini;
  REP(i, N){
    cin >> A[i];
    if(A[i] == 1){
      mini = i;
    }
  }

  int start = max(0, mini-K+1);
  int end = min(mini, N-K);
  int minc = 1e9;
  FOR(i, start, end+1){
    int cnt = i/(K-1)+((N-1)-(i+K-1))/(K-1);
    int right = i/(K-1);
    int left = ((N-1)-(i+K-1))/(K-1);
    if(i%(K-1)){
      cnt++;
      right++;
    }
    if(((N-1)-(i+K-1))%(K-1)){
      cnt++;
      left++;
    }
    //cout << i << " " << right << " " << left << endl;
    minc = min(minc, cnt+1);
  }
  cout << minc << endl;


  return 0;
}

Submission Info

Judge Result