蓝书——284. 金字塔

区间DP

为了不重不漏，枚举区间第一颗子树的区间。

 

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//typedef __int128 LL;
//typedef unsigned long long ull;
//#define F first
//#define S second
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
const ld PI=acos(-1);
const ld eps=1e-9;
//unordered_map<int,int>mp;
#define ls (o<<1)
#define rs (o<<1|1)
#define pb push_back
//#define a(i,j) a[(i)*(m+2)+(j)]  //m是矩阵的列数
//pop_back()
const int seed=131;
const int mod=1e9;
const int M = 307;
/*int head[M],cnt;
struct EDGE{int to,nxt,val;}ee[M];
void add(int x,int y,int z){ee[++cnt].nxt=head[x],ee[cnt].to=y,ee[cnt].val=z,head[x]=cnt;}*/
char s[M];
ll f[M][M];//区间l r 子树可能的个数 
int main()
{
  	scanf("%s",s+1);
  	int n=strlen(s+1);
  	for(int i=1;i<=n;i++)f[i][i]=1;
  	for(int len=3;len<=n;len++)
  	{
  		for(int l=1;l+len-1<=n;l++)
  		{
  			int r=l+len-1;
  			if(s[l]!=s[r])continue;
  			for(int k=l;k<r;k++)
  			f[l][r]=(f[l][r]+f[l+1][k]*f[k+1][r])%mod;
  	//		f[l][r]+=f[l+1][r-1];
  		//	cout<<l<<" "<<r<<"   "<<f[l][r]<<endl;
		}
	}
  	cout<<f[1][n]<<endl;
	return 0;
}

递归写法

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//typedef __int128 LL;
//typedef unsigned long long ull;
//#define F first
//#define S second
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
const ld PI=acos(-1);
const ld eps=1e-9;
//unordered_map<int,int>mp;
#define ls (o<<1)
#define rs (o<<1|1)
#define pb push_back
//#define a(i,j) a[(i)*(m+2)+(j)]  //m是矩阵的列数
//pop_back()
const int seed=131;
const int mod=1e9;
const int M = 307;
/*int head[M],cnt;
struct EDGE{int to,nxt,val;}ee[M];
void add(int x,int y,int z){ee[++cnt].nxt=head[x],ee[cnt].to=y,ee[cnt].val=z,head[x]=cnt;}*/
char s[M];
ll f[M][M];//区间l r 子树可能的个数 
int vs[M][M];
ll dfs(int l,int r)
{
//	if(l>r)return 0;
	//cout<<l<<" "<<r<<" "<<f[l][r]<<endl;
	if(vs[l][r])return f[l][r];
	for(int i=l+1;i<=r-1;i++)
	{
		if(s[l]!=s[r])f[l][r]=0,vs[l][r]=1;
		else 
		f[l][r]=(f[l][r]+dfs(l+1,i)*dfs(i+1,r))%mod;
	}
	vs[l][r]=1;
	return f[l][r];
}
int main()
{
  	scanf("%s",s+1);
  	int n=strlen(s+1);
  	for(int i=1;i<=n;i++)f[i][i]=1,vs[i][i]=1;
  	cout<<dfs(1,n)<<endl;
	return 0;
}