Jonnesort

#include <bits/stdc++.h>

using namespace std;

int main(void)
{
 cin.sync_with_stdio(0);
 cin.tie(0);
 int n = 0, k = 0;
 cin >> n >> k;
 vector<int> arr(n);
 for (int i = 0; i < n; i++)
 {
        cin >> arr[i];
 }
 vector<int> arr2(arr);
 sort(arr2.begin(), arr2.end());
 
 int maxdist = -1;
 
 for (unsigned int i = 0; i < arr.size(); ++i)
 {
     auto ptr = lower_bound(arr2.begin(), arr2.end(), arr[i]);
     
     //if (ptr)
     {
         int idx = ptr - arr2.begin();
         
         //out << "arr[i] " << arr[i] << "\n";
         //cout << "idx " << idx << "\n";
         
         int dist = abs(idx - (int)i);
         
         //cout << "dist " << dist << "\n\n";
         
         if (dist > maxdist)
            maxdist = dist;
     }
 
     
 }
 
 // cout << "maxd " << maxdist << "\n";
 
 float resf = (float) maxdist / (float) k;
 int res = ceil(resf) + 1;
 
 cout << res << endl;
     
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: ACCEPTED

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: ACCEPTED

Test 13

Verdict: WRONG ANSWER

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: WRONG ANSWER

Test 22

Verdict: ACCEPTED

Test 23

Verdict: WRONG ANSWER

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