UVa 11379 Chichi's Home Work

我就是来贴个题解，我没看懂，如果有人看懂了，求指教

//
//  Created by  CQU_CST_WuErli
//  Copyright (c) 2015 CQU_CST_WuErli. All rights reserved.
//
// #include<bits/stdc++.h>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <algorithm>
#include <sstream>
#define CLR(x) memset(x,0,sizeof(x))
#define OFF(x) memset(x,-1,sizeof(x))
#define MEM(x,a) memset((x),(a),sizeof(x))
#define For_UVa if (kase!=1) cout << endl
#define BUG cout << "I am here" << endl
#define lookln(x) cout << #x << "=" << x << endl
#define SI(a) scanf("%d",&a)
#define SII(a,b) scanf("%d%d",&a,&b)
#define SIII(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define rep(flag,start,end) for(int flag=start;flag<=end;flag++)
#define Rep(flag,start,end) for(int flag=start;flag>=end;flag--)
#define Lson l,mid,rt<<1
#define Rson mid+1,r,rt<<1|1
#define Root 1,n,1
#define BigInteger bign
template <typename T> T gcd(const T& a,const T& b) {return b==0?a:gcd(b,a%b);}
const int MAX_L=2005;// For BigInteger
const int INF_INT=0x3f3f3f3f;
const long long INF_LL=0x7fffffff;
const int MOD=1000000000;
const double eps=1e-9;
const double pi=acos(-1);
typedef long long  ll;
using namespace std;

const int N=1010;

int n,x,y;

ll f[N];

void init() {
    f[0]=1;f[1]=1;f[2]=2;
    rep(i,3,1000) {
        f[i]=0;
        rep(j,0,i-1) {
            f[i]=(f[i]+(f[j]*f[i-1-j])%MOD)%MOD;
        }
    }
}

ll dp[N][N];

int DP(int l,int r) {
    if (l>n || r>n || r>l) return 0;
    if (l==n && r==n) return 1;
    ll &ans=dp[l][r];
    if (ans!=-1) return ans;
    ans=0;
    if (l==x) {
        rep(i,y-x,n-x) {
            ll tmp=f[i]*DP(l+i,r+i+1)%MOD;
            ans=(ans+tmp)%MOD;
        }
    }
    else {
        ans=(ans+DP(l+1,r))%MOD;
        ans=(ans+DP(l,r+1))%MOD;
    }
    return ans%MOD;
}


int main(){
#ifdef LOCAL
    freopen("C:\\Users\\john\\Desktop\\in.txt","r",stdin);
//  freopen("C:\\Users\\john\\Desktop\\out.txt","w",stdout);
#endif
    init();
//  cout << f[4] << endl;
    while (SIII(n,x,y)==3) {
        OFF(dp);
        ll ans=DP(0,0)%MOD;
        cout << ans << endl;
    }
    return 0;
}