Problem 3768 · Hard

Minimum Inversion Count in Subarrays of Fixed Length

Count the inversions inside every window of fixed length and keep the smallest count.

Open the interactive visualisation