九度 题目1044：Pre-Post m元树问题

题目1044：Pre-Post
时间限制：1 秒内存限制：32 兆特殊判题：否提交：793解决：449
题目描述：
We are all familiar with pre-order, in-order and post-order traversals of binary trees. A common problem in data structure classes is to find the pre-order traversal of a binary tree when given the in-order and post-order traversals. Alternatively, you can find the post-order traversal when given the in-order and pre-order. However, in general you cannot determine the in-order traversal of a tree when given its pre-order and post-order traversals. Consider the four binary trees below:

All of these trees have the same pre-order and post-order traversals. This phenomenon is not restricted to binary trees, but holds for general m-ary trees as well.
输入：
Input will consist of multiple problem instances. Each instance will consist of a line of the form
m s1 s2
indicating that the trees are m-ary trees, s1 is the pre-order traversal and s2 is the post-order traversal.All traversal strings will consist of lowercase alphabetic characters. For all input instances, 1 <= m <= 20 and the length of s1 and s2 will be between 1 and 26 inclusive. If the length of s1 is k (which is the same as the length of s2, of course), the first k letters of the alphabet will be used in the strings. An input line of 0 will terminate the input.
输出：
For each problem instance, you should output one line containing the number of possible trees which would result in the pre-order and post-order traversals for the instance. All output values will be within the range of a 32-bit signed integer. For each problem instance, you are guaranteed that there is at least one tree with the given pre-order and post-order traversals.
样例输入：
2 abc cba
2 abc bca
10 abc bca
13 abejkcfghid jkebfghicda
样例输出：
4
1
45
207352860
结果：
AC

code:

#include<iostream>
#include<string>
#define ll long long 
using namespace std;
int m;
string s, t;
ll combination(int n, int m){
    ll ret = 1;
    for (int i = 2; i <= n; i++)
        ret *= i;
    for (int i = 2; i <= n - m; i++)
        ret /= i;
    for (int i = 2; i <= m; i++)
        ret /= i;
    return ret;
}
ll count(string pre, string post){
    if (pre[0]!=post[post.size()-1])return 0;//若错误，说明pre-post不匹配，则递归乘以0，结果为0
    if (pre.size() == 1)return 1;
    ll ret = 1;
    int i = 1,cnt=0;
    while(i<pre.size()){
        int j = i;
        while (i<pre.size()&&post[i - 1] != pre[j])i++;
        cnt++;
        ret *= count(pre.substr(j, i - j + 1), post.substr(j - 1, i - j+1));
        i++;
    }
    ret *= combination(m, cnt);
    return ret;
}
int main(){
    while (cin >> m>>s>>t){
        cout << count(s, t) << endl;
    }
    return 0;
}