Jonnesort

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>

using namespace std;

typedef long long LL;

int main(){
	LL n,k;
	cin >> n >> k;
	vector<LL> v;
	for(int i = 0; i < n; i++){
		LL x; cin >> x;
		v.push_back(x);
	}

	vector<LL> v_sorted = v;
	sort(v_sorted.begin(), v_sorted.end());

	vector<bool> used(n);
	LL worst = 0;
	for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++){
			if(v_sorted[j] == v[i] && used[j] == false){
				used[j] = true;
				worst = max(worst, (LL)(i-j));
				break;
			}
		}
	}
	
	LL ans = worst / (k-1) + 1;
	if(worst % (k-1) != 0) ans++;
	cout << ans << endl;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: ACCEPTED

Test 23

Verdict: ACCEPTED

Test 24

Verdict: ACCEPTED

Test 25

Verdict: ACCEPTED

Test 26

Verdict: ACCEPTED

Test 27

Verdict: ACCEPTED

Test 28

Verdict: ACCEPTED

Test 29

Verdict: ACCEPTED

Test 30

Verdict: ACCEPTED

Test 31

Verdict: ACCEPTED

Test 32

Verdict: ACCEPTED