Description 懒得抠了在这里 题解 实际上就是把区间分成若干块，每块的逆序对总和最小 朴素dp不难想到是 f [ i ] [ j ] = m i n ( f [ k ] [ j − 1 ] + s o l v e ( k + 1 , i ) ) f[i][j]=min(f[k][j-1]+solve(k+1,i)) f[i][j]=min(f[k][j−1]+solve(