Codeforce 149D Coloring Brackets

一个区间DP。

dp[L][R][C1][C2]表示区间[L,R]，L用C1染色，R用C2染色的值，题目不错，需要注意细节处理，用记忆化写非常好！

/*
 * D.cpp
 *
 *  Created on: 2013-7-20
 *      Author: zy
 */
#include<cstdio>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<algorithm>
using namespace std;
const int mod = 1000000007;
char str[710];
long long dp[710][710][3][3];
int ma[710];
int n;
void init()
{
	n = strlen(str + 1);
	memset(dp, -1, sizeof(dp));
	stack<int> s;
	for (int i = 1; i <= n; i++)
	{
		if (str[i] == '(')
		{
			s.push(i);
		}
		else
		{
			ma[s.top()] = i;
			s.pop();
		}
	}
}
bool check(int a, int b)
{
	return a == 0 || b == 0 || a != b;
}
long long solve(int l, int r, int c1, int c2)
{
	if (dp[l][r][c1][c2] >= 0)
		return dp[l][r][c1][c2];
	long long res = 0;
	if (ma[l] == r)
	{
		if ((c1 == 0) ^ (c2 == 0))
		{
			if (l + 1 == r)
				return dp[l][r][c1][c2] = 1;

			for (int i = 0; i < 3; i++)
				for (int j = 0; j < 3; j++)
				{
					if (check(c1, i) && check(c2, j))
					{
						res = (res + solve(l + 1, r - 1, i, j)) % mod;
					}
				}
		}
		else
		{
			return dp[l][r][c1][c2] = 0;
		}
	}
	else
	{
		for (int i = 0; i < 3; i++)
			for (int j = 0; j < 3; j++)
			{
				if (check(i, j))
				{
					res += solve(l, ma[l], c1, i) * solve(ma[l] + 1, r, j, c2);
				}
			}
	}
	return dp[l][r][c1][c2] = res % mod;
}

int main()
{
	gets(str + 1);
	init();
	long long ans = 0;
	for (int i = 0; i < 3; i++)
	{
		for (int j = 0; j < 3; j++)
		{
			ans = (ans + solve(1, n, i, j)) % mod;
		}
	}
	printf("%lld\n", ans);
	return 0;
}