LA 3516(ZOJ 2641) Exploring Pyramids（递推 DP）

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 <tex2html_verbatim_mark>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 first enters the cave connected to the outer world along the passage. When it travels along any passage for the first 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 find 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 important, so the caves (c) and (d) on the picture below are considered different.

<tex2html_verbatim_mark>

Input

The input file contains several test cases, and each of them consists of a single line with 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

For each input case, write to the output a single line containing one integer number - the number of different cave systems (modulo 1 000 000 000) that could produce the output tape.

Sample Input

ABABABA
AB

Sample Output

5
0

题目大意：给出一棵多叉树，每个结点的任意两个子结点都有左右之分。从根结点开始，每次尽量往左走，走不通了就回溯，把遇到的字母顺序记录下来，可以得到一个序列。如图所示的序列均为 ABABABA 。给定一个序列，问有多少棵树与之对应。

分析：设输入序列为S，d(i,j)为子序列Si,Si+1,...,Sj对应的个数，则边界条件是d(i,i)=1，且Si不等于Sj时d(i,j)=0（因为起点和终点应是同一点）。在其他情况下，设第一个分支在Sk时回到树根（必须有Si=Sk），则这个分支对应的序列是Si+1,...,Sk-1，方案数为d(i+1,k-1)，其他分支对应的访问序列为Sk,...,Sj，方案数为d(k,j)。这样，在非边界情况，递推关系为d(i,j)=sum{d(i+1,k-1)*d(k,j)|i+2<=k<=j,Si=Sk=Sj}

代码如下：

#include<cstdio>
#include<cstring>
using namespace std;

const int maxn =  + ;
const int MOD = ;
typedef long long LL;

char S[maxn];
int d[maxn][maxn];

int dp(int i, int j) {
  if(i == j) return ;
  if(S[i] != S[j]) return ;
  int& ans = d[i][j];
  if(ans >= ) return ans;
  ans = ;
  for(int k = i+; k <= j; k++) if(S[i] == S[k])
    ans = (ans + (LL)dp(i+,k-) * (LL)dp(k,j)) % MOD;
  return ans;
}

int main() {
  while(scanf("%s", S) == ) {
    memset(d, -, sizeof(d));
    printf("%d\n", dp(, strlen(S)-));
  }
  return ;
}