2021.08.26 A. Simply Strange Sort | Round #740 Div.2 n (3 ≤ n ≤ 999) a1, a2, ..., an(1 <= ai <= n) For each test case print the number of iterations after which the permutation will become sorted in increasing order for the first time. If the given permutation is already s... 2021.08.262021.08.26
A. Simply Strange Sort | Round #740 Div.2 n (3 ≤ n ≤ 999) a1, a2, ..., an(1 <= ai <= n) For each test case print the number of iterations after which the permutation will become sorted in increasing order for the first time. If the given permutation is already s... 2021.08.262021.08.26