codechef Chef and Bracket-Pairs

好dp啊，不会写，刚开始用分治写dfs不知道怎么样的数据错了，结果用的dp

dp[i][j] = dp[i+1][j] + SUM(dp[i+1][k] + dp[k+1][j]) (a[i]+a[k]==0 && a[i]<0)

题目链接：http://www.codechef.com/problems/CHEFBR

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <queue>
#include <map>
using namespace std;
#define INF 1e9
#define maxn 110
#define rep(i,x,y) for(int i=x;i<=y;i++)
#define mset(x) memset(x,0,sizeof(x))
typedef long long ll;

const int MOD = 1e9+7;
ll dp[maxn][maxn];
ll a[maxn];
int n;

int main(){
//	freopen("a.txt","r",stdin);
//	freopen(".out","w",stdout);

	//dp[i][j]表示[i, j]上的正确式子的总数
	//dp[i][i]=1, dp[i+1][i]=1
	while(cin>>n)
	{
		rep(i,1,n)	scanf("%lld", &a[i]);
		
		mset(dp);
		rep(i,1,n){
			dp[i][i]=1;
			dp[i+1][i]=1;
		}

		for(int i=n-1; i>0; i--)
		{
			rep(j,i+1,n)
			{
				dp[i][j] = dp[i+1][j];
				rep(k, i+1, j)
				{
					if(a[i] + a[k] == 0 && a[i]<0)
						dp[i][j] = (dp[i][j] + dp[i+1][k]*dp[k+1][j]) % MOD;
				}
			//	printf("dp[%d][%d]=%d\n", i, j, dp[i][j]);
			}
		}

		printf("%lld\n", dp[1][n]%MOD);
	}
	return 0;
}