题目:http://www.lydsy.com/JudgeOnline/problem.php?id=1079
分析:一看就觉得是dp或者直接排列组合公式或者容斥?。。。。我就只想到dp的,我们用dp[i][j]表示前i种颜色,排列出有j对相邻一样颜色的方案数。当出现一个新的颜色时,我们把这个颜色插板法插进去,我们要枚举插入的方式,可能插到相邻颜色一样的中间,或者不是,然后进行状态转移........具体看代码。
代码:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <stack>
#include <string.h>
#include <queue>
#include <vector>
#include <algorithm>
#include <cassert>
#include <set>
#include <map>
#include <cmath>
#include <ctime>
using namespace std;
#define rep(i,a,b) for(int i=(a);i<(b);++i)
#define rrep(i,a,b) for(int i=(a);i>=(b);--i)
#define clr(a,x) memset(a,(x),sizeof(a))
#define eps 1e-8
#define LL long long
#define mp make_pair
const int maxn=5*15+5;
const int mod=1e9+7;
LL A[maxn],revA[maxn];
LL dp[maxn][maxn];
inline LL AA(int n,int m) { return A[n]*revA[n-m]%mod; }
LL qpow(LL base,LL p)
{
LL ret=1;
while(p) {
if(p&1) ret=ret*base%mod;
base=base*base%mod;
p>>=1;
}
return ret;
}
vector<int> v;
int slot;
int cnt[2][10];
void DoSum(LL d,int same,int bit,LL & t)
{
clr(cnt,0);
int sz=v.size();
int a=0,b=0;
rep(j,0,sz) {
if((1<<j)&bit) {
cnt[0][v[j]]++;
++a;
} else {
cnt[1][v[j]]++;
++b;
}
}
LL C=AA(same,a)*AA(slot-same+1,b)%mod;
rep(i,1,6) {
if(cnt[0][i]>1) C=C*revA[cnt[0][i]]%mod;
if(cnt[1][i]>1) C=C*revA[cnt[1][i]]%mod;
}
t = (t+d*C%mod)%mod;
char zzz='l';
}
set<int> vis;
void Dosomething(int cur)
{
int sz=v.size();
int s=0; rep(i,0,sz) s += v[i]-1;
vis.clear();
rep(i,0,(1<<sz)) {
LL ss=0;
int k=0;
rep(j,0,sz)
if((1<<j)&i) { ss |= ((LL)v[j]<<(3*k)); ++k; }
else { ss |= ((LL)v[j]<<(3*(j-k+5))); }
if(slot+1-k<sz-k) continue;
if(vis.count(ss)) continue;
vis.insert(ss);
rep(j,k,slot) {
if(dp[cur][j]==0) continue;
if(slot+1-j<sz-k) break;
DoSum(dp[cur][j],j,i,dp[cur+1][j+s-k]);
}
}
}
void dfs1(int first,int rest,int cur)
{
if(rest==0) {
Dosomething(cur);
return;
}
if(rest<first) return;
rep(i,first,100) {
v.push_back(i);
dfs1(i,rest-i,cur);
v.pop_back();
}
}
int n;
int main()
{
//freopen("in.txt","r",stdin);
A[0]=revA[0]=1;
rep(i,1,maxn) A[i]=A[i-1]*i%mod,revA[i]=qpow(A[i],mod-2);
while(scanf("%d",&n)==1) {
LL ans=0; slot=0;
clr(dp,0);
rep(i,0,n) {
int x; scanf("%d",&x);
if(x==0) continue;
if(i==0) { dp[1][x-1]=1; slot += x; continue; }
dfs1(1,x,i);
slot += x;
}
ans=dp[n][0];
printf("%lld\n",ans);
}
}