CF1367F2 Flying Sort (Hard Version)

This is a hard version of the problem. In this version, the given array can contain equal elements and the constraints on $ n $ are greater than in the easy version of the problem. You are given an array $ a $ of $ n $ integers (the given array can contain equal elements). You can perform the following operations on array elements: 1. choose any index $ i $ ( $ 1 \le i \le n $ ) and move the element $ a[i] $ to the begin of the array; 2. choose any index $ i $ ( $ 1 \le i \le n $ ) and move the element $ a[i] $ to the end of the array. For example, if $ n = 5 $ , $ a = [4, 7, 2, 2, 9] $ , then the following sequence of operations can be performed: - after performing the operation of the first type to the second element, the array $ a $ will become $ [7, 4, 2, 2, 9] $ ; - after performing the operation of the second type to the second element, the array $ a $ will become $ [7, 2, 2, 9, 4] $ . You can perform operations of any type any number of times in any order. Find the minimum total number of operations of the first and second type that will make the $ a $ array sorted in non-decreasing order. In other words, what is the minimum number of operations must be performed so the array satisfies the inequalities $ a[1] \le a[2] \le \ldots \le a[n] $ .

N/A

N/A

In the first test case, you first need to move two 2, to the beginning of the array. Therefore, the desired sequence of operations: $ [4, 7, 2, 2, 9] \rightarrow [2, 4, 7, 2, 9] \rightarrow [2, 2, 4, 7, 9] $ . In the second test case, you need to move the 1 to the beginning of the array, and the 8 — to the end. Therefore, the desired sequence of operations: $ [3, 5, 8, 1, 7] \rightarrow [1, 3, 5, 8, 7] \rightarrow [1, 3, 5, 7, 8] $ . In the third test case, the array is already sorted.