【题意分析】
属于比较简单的状压dp,数据范围20也提示得非常明显。
我们压排好第 i i i种偶像的状态,0没排,1排
直接上:dp[i]
表示
i
i
i这个状态最少需要移动几次
注意到你要排好,实际上不用纠结人从哪里排起,因为你选中的偶像排好,其他人是可以随便插入的,因此我们假定最后排好的状态偶像们是从前往后站的,没有排好的一律放在最后面。
那么我们就对于这个状态枚举偶像,假定第j种偶像排在 [ L , R ] [L,R] [L,R],显而易见的dp方程式:
d p [ i ∣ ( 1 < < j ) ] = min ( d p [ i ∣ ( 1 < < j ) ] , d p [ i ] + ( R − L + 1 ) ) − ( s u m [ R ] [ j ] − s u m [ L − 1 ] [ j ] ) dp[i~|~(1<<j)]=\min(dp[i~|~(1<<j)],dp[i]+(R-L+1))-(sum[R][j]-sum[L-1][j]) dp[i ∣ (1<<j)]=min(dp[i ∣ (1<<j)],dp[i]+(R−L+1))−(sum[R][j]−sum[L−1][j])
其中sum[i][j]
是前i个位置第j种偶像的个数,直接前缀和维护
Code:
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <algorithm>
#define MAXN 2000000
#define INF 2147400000
using namespace std;
int dp[MAXN], sum[100005][21], n, m;
inline int read () {
register int s = 0, w = 1;
register char ch = getchar ();
while (! isdigit (ch)) {if (ch == '-') w = -1; ch = getchar ();}
while (isdigit (ch)) {s = (s << 3) + (s << 1) + (ch ^ 48); ch = getchar ();}
return s * w;
}
int main () {
n = read (), m = read (); int SIT = (1 << m) - 1;
for (register int i = 1; i <= n; i++) {
for (register int j = 1; j <= m; j++) sum[i][j] = sum[i - 1][j];
sum[i][read ()]++;
}
for (register int i = 1; i <= SIT; i++) dp[i] = INF; dp[0] = 0;
for (register int i = 0; i <= SIT; i++) {
int pre = 0;
for (register int j = 0; j < m; j++) if (1 & (i >> j)) pre += sum[n][j + 1];
for (register int j = 0; j < m; j++) {
if (1 & (i >> j)) continue;
int L = pre + 1, R = pre + sum[n][j + 1];
dp[i | (1 << j)] = min (dp[i | (1 << j)], dp[i] + (R - L + 1) - (sum[R][j + 1] - sum[L - 1][j + 1]));
}
}
return printf ("%d\n", dp[SIT]), 0;
}