uva1362 Exploring Pyramids

Archaeologists have discovered a new set of hidden caves in one of the
Egyptian pyramids. The decryption of ancient hieroglyphs on the walls
nearby showed that the caves structure is as follows. There are n
caves in a pyramid, connected by narrow passages, one of the caves is
connected by a passage to the outer world. The system of the passages
is organized in such a way, that there is exactly one way to get from
outside to each cave along passages. All caves are located in the
basement of the pyramid, so we can consider them being located in the
same plane. Passages do not intersect. Each cave has its walls colored
in one of several various colors. The scientists have decided to
create a more detailed description of the caves, so they decided to
use an exploring robot. The robot they are planning to use has two
types of memory | the output tape, which is used for writing down the
description of the caves, and the operating memory organized as a
stack. The robot rst enters the cave connected to the outer world
along the passage. When it travels along any passage for the rst
time, it puts its description on the top of its stack. When the robot
enters any cave, it prints the color of its walls to its output tape.
After that it chooses the leftmost passage among those that it has not
yet travelled and goes along it. If there is no such passage, the
robot takes the passage description from the top of its stack and
travels along it in the reverse direction. The robot’s task is over
when it returns to the outside of the pyramid. It is easy to see that
during its trip the robot visits each cave at least once and travels
along each passage exactly once in each direction. The scientists have
sent the robot to its mission. After it returned they started to study
the output tape. What a great disappointment they have had after they
have understood that the output tape does not describe the cave system
uniquely. Now they have a new problem | they want to know how many
different cave systems could have produced the output tape they have.
Help them to nd that out. Since the requested number can be quite
large, you should output it modulo 1 000 000 000. Please note, that
the absolute locations of the caves are not important, but their
relative locations are impor- tant, so the caves (c) and (d) on the
picture below are considered different. Input The input le contains
the output tape that the archaeologists have. The output tape is the
sequence of colors of caves in order the robot visited them. The
colors are denoted by capital letters of the English alphabet. The
length of the tape does not exceed 300 characters. Output Output one
integer number | the number of different cave systems (modulo 1 000
000 000) that could produce the output tape.

区间dp，枚举走完第一个子树之后回到根节点的位置。

$$dp(i,j)=\sum_{k=i+2}^j dp(i+1,k-1) * dp(k,j) (s_i=s_j=s_k)$$

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define LL long long
const int mod=1e9;
char s[310];
int dp[310][310];
int main()
{
    int i,j,k,l,x;
    while (scanf("%s",s+1)==1)
    {
        l=strlen(s+1);
        memset(dp,0,sizeof(dp));
        for (i=1;i<=l;i++)
          dp[i][i]=1;
        for (k=2;k<=l;k++)
          for (i=1;(j=i+k-1)<=l;i++)
            if (s[i]==s[j])
              for (x=i+2;x<=j;x++)
                if (s[i]==s[x])
                  dp[i][j]=(dp[i][j]+(LL)dp[i+1][x-1]*dp[x][j]%mod)%mod;
        printf("%d\n",dp[1][l]);
    }
}