BZOJ 1002: [FJOI2007]轮状病毒

首先考虑暴力：

#include <bits/stdc++.h>
using namespace std;
const int N=105;
int n,cnt,ans;
int a[N],f[N];
struct number{int x,y;}num[N];

int find(int x)
{
	if (f[x]==x) return x;
	return f[x]=find(f[x]);
}

inline void init()
{
	int sum=0;
	for (register int i=1; i<=cnt; ++i) sum+=a[i];
	if (sum!=n-1) return;
	for (register int i=1; i<=n; ++i) f[i]=i;
	int x,y;
	for (register int i=1; i<=cnt; ++i)
	if (a[i])
	{
		x=find(num[i].x); y=find(num[i].y);
		if (f[x]==f[y]) return;
		f[x]=f[y];
	}
	ans++;
}

void dfs(int x)
{
	if (x==cnt+1)
	{
		init();
		return;
	}
	a[x]=0; dfs(x+1);
	a[x]=1; dfs(x+1);
}

int main(){
	scanf("%d",&n);
	n++;
	for (register int i=2; i<=n; ++i) cnt++,num[cnt].x=1,num[cnt].y=i;
	for (register int i=2; i<n; ++i) cnt++,num[cnt].x=i,num[cnt].y=i+1;
	cnt++,num[cnt].x=n,num[cnt].y=2;
	dfs(1);
	printf("%d\n",ans);
return 0;
}

根据上面的暴力打出一个表，然后找一波规律，发现表中数字可以用一个二阶差分来表示。（附上有加法，减法，乘法的重载高精度模板）

#include <bits/stdc++.h>
using namespace std;
int n;

struct number
{
	short t[105],len;
	number(){memset(t,0,sizeof(t));}
	inline friend number operator + (number a,number b)
	{
		number c;
		c.len=max(a.len,b.len);
		for (register int i=1; i<=c.len; ++i) c.t[i]=a.t[i]+b.t[i];
		for (register int i=1; i<=c.len; ++i)
		{
			c.t[i+1]+=c.t[i]/10;
			c.t[i]%=10;	
		}
		if (c.t[c.len+1]) c.len++;
		return c;
	}
	inline friend number operator - (number a,number b)  //前提是保证a>=b 
	{
		short now=0;
		for (register int i=1; i<=a.len; ++i) 
		{
			a.t[i]-=now; now=0;
			if (a.t[i]<b.t[i]) a.t[i]=a.t[i]+10-b.t[i],now=1;
			else a.t[i]-=b.t[i];
		}
		while (!a.t[a.len] && a.len>1) a.len--;
		return a;
	}
	inline friend number operator * (number a,number b)
	{
		number c;
		c.len=a.len+b.len-1;
		for (register int i=1; i<=a.len; ++i)
		for (register int j=1; j<=b.len; ++j) c.t[i+j-1]=a.t[i]*b.t[j];
		for (register int i=1; i<=c.len; ++i)
		{
			c.t[i+1]+=c.t[i]/10;
			c.t[i]%=10;
		}
		while (c.t[c.len+1]) c.len++;
		return c;
	}
}f[105],a1[105],a2[105];

int main(){
	scanf("%d",&n);
	f[1].len=1; f[1].t[1]=1;
	f[2].len=1; f[2].t[1]=5;
	a1[2].len=1; a1[2].t[1]=4;
	a2[2].len=1; a2[2].t[1]=7;
	for (register int i=3; i<=n; ++i)
	{
		a1[i]=a1[i-1]+a2[i-1];
		f[i]=f[i-1]+a1[i];
		a2[i]=a2[i-1]+a1[i];
	}
	for (register int i=f[n].len; i>=1; --i) printf("%d",f[n].t[i]);
return 0;
}

还有一个环形计数动规的方法，但是我今天想了一节课还是不是特别理解，留坑等填。DP代码