POJ 2084 大数 + DP

题意

传送门 POJ 2084

题解

若满足各点对连线且不交叉，那么对于某条连线，其上方与下方的点数为偶数，那么枚举某点的连线即得到递推公式。设 $dp[i]$ 代表点对数为 $i$ 的连线总数，则有
$$dp[i]=\sum _{j=0}^{i-1}dp[j]\times dp[i-1-j]$$

#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
using namespace std;
#define maxn 100
#define base 100000000
#define maxl 20
typedef long long ll;
struct bigInt
{
    int len;
    ll a[maxl + 1];
    bigInt() : len(0)
    {
        memset(a, 0, sizeof(a));
    }
    void operator=(int n)
    {
        a[0] = n, len = 1;
    }
    bigInt operator*(bigInt &b)
    {
        bigInt res;
        for (int i = 0; i < len; ++i)
            for (int j = 0; j < b.len; ++j)
                res.a[i + j] += a[i] * b.a[j];
        res.len = len + b.len;
        for (int i = 0; i < len; ++i)
        {
            res.a[i + 1] += res.a[i] / base;
            res.a[i] %= base;
        }
        while (!res.a[res.len - 1])
            --res.len;
        return res;
    }
    void operator+=(bigInt b)
    {
        len = max(len, b.len);
        for (int i = 0; i < len; ++i)
        {
            a[i] += b.a[i];
            a[i + 1] += a[i] / base;
            a[i] %= base;
        }
        if (a[len] > 0)
            ++len;
    }
    void write()
    {
        printf("%lld", a[len - 1]);
        for (int i = len - 2; i >= 0; --i)
            printf("%08lld", a[i]);
        putchar('\n');
    }
};
int n;
bigInt res[maxn + 1];

int main()
{
    res[0] = 1, res[1] = 1;
    for (int i = 2; i <= maxn; ++i)
        for (int j = 0; j < i; ++j)
            res[i] += res[j] * res[i - 1 - j];

    while (~scanf("%d", &n) && n != -1)
        res[n].write();
    return 0;
}