BZOJ1079

http://hzwer.com/1884.html

解释得很清楚

注意F数组的定义

这么多维的DP写记忆化搜索会更好写

<span style="font-size:14px;">#include <iostream>
#include <cstdio>

#define mod 1000000007LL
#define N 16

using namespace std;

typedef long long LL;

int x[10],n;
LL F[N][N][N][N][N][6];
bool vis[N][N][N][N][N][6];

LL DP(int a,int b,int c,int d,int e,int k) {
	if (a+b+c+d+e == 0) return 1LL;
	if (vis[a][b][c][d][e][k]) return F[a][b][c][d][e][k];
	
	LL tmp = 0LL;
	if (a > 0) 
		tmp += 1LL * (a - (k == 2)) * DP(a-1,b,c,d,e,1);
	if (b > 0)
		tmp += 1LL * (b - (k == 3)) * DP(a+1,b-1,c,d,e,2);
	if (c > 0)
		tmp += 1LL * (c - (k == 4)) * DP(a,b+1,c-1,d,e,3);
	if (d > 0)
		tmp += 1LL * (d - (k == 5)) * DP(a,b,c+1,d-1,e,4);
	if (e > 0)
		tmp += 1LL * e * DP(a,b,c,d+1,e-1,5);
	
	vis[a][b][c][d][e][k] = true;
	return (F[a][b][c][d][e][k] =  (tmp % mod));
	//return tmp % mod;
		
}

int main()
{
	scanf("%d",&n);
	for (int i=1;i<=n;i++) {
		int t = 0; scanf("%d",&t);
		x[t]++;
	}
	
	#ifndef ONLINE_JUDGE
		printf("%I64d\n",DP(x[1],x[2],x[3],x[4],x[5],0));
	#else
		printf("%lld\n",DP(x[1],x[2],x[3],x[4],x[5],0));
	#endif
	return 0;
}</span>