Bzoj1231 [Usaco2008 Nov]mixup2 混乱的奶牛

原题网址：http://www.lydsy.com/JudgeOnline/problem.php?id=1231
题目简述：给出$n$(4$\le$n$\le$16)个数，求满足任意相邻元素差大于$k$的排列数。
题解：看数据范围像是压位，实际上就是压位。用$f[i][j][s]$表示前$i$位，最后一位是$j$，已经放过的集合是$s$的方案数。枚举第$i+1$位放什么，直接转移即可。

var
  f:array[1..16,1..16,0..65535] of int64;
  a,v:array[1..16] of longint;
  n,m,limit,i,j,k,s:longint;
  ans:int64;
begin
  read(n,m);
  limit:=1<<n-1;
  for i:=1 to n do read(a[i]);
  for i:=1 to n do v[i]:=1<<(i-1);
  for i:=1 to n do f[1][i][v[i]]:=1;
  for i:=1 to n-1 do
    for j:=1 to n do
      for s:=0 to limit do
        if (s and v[j]>0) then
          for k:=1 to n do
            if ((s and v[k]=0)and(abs(a[k]-a[j])>m))
              then inc(f[i+1][k][s xor v[k]],f[i][j][s]);
  ans:=0;
  for j:=1 to n do
    inc(ans,f[n][j][limit]);
  writeln(ans);
end.