原题地址POJ 1141
区间DP基本思想,tlen 1,2,3…n 把所有长度为tlen的连续区间遍历一遍, 求出其最优解,记录到dp数组中,不断更新。则当tlen=n 时,即为最优解。
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
const int MAX = 110;
const int INF = 0x3f3f3f3f;
(BreakPoint[i][j]这一数组存储的是i->j这一区间上,把合法符号最多“即步数
最少”的区间和剩下的区间分开的断点,这样做的意义在于每一次断点的细分都会有一
个最优子区间,直至分解为长度为二的区间,此时要么本身合法要么断点是左边的字
符)
int dp[MAX][MAX], BreakPoint[MAX][MAX];
char str[MAX];
void print(int begain, int over);
int main()
{
int begain, over, i;
int len, tlen, point;
while(gets(str))(这个输入函数会好一点,被坑了好久。一直WR,还好问学长了)
{
len=strlen(str);
memset(dp,0x3f,sizeof(dp));
(当tlen==1时,把它变为合法的最小步数为1)
for(i=0; i<len; i++)dp[i][i]=1;
for(tlen=2; tlen<=len; tlen++) (子区间长度 2->n)
for(i=0; i<=len-tlen; i++) (枚举所有连续的长为tlen的子区间)
{
begain=i; (子区间起点)
over=begain+tlen-1; (终点)
(如果本身即合法,则断点为-1,任意附一个无效值)
if((str[begain]=='['&&str[over]==']')||(str[begain]=='('&&str[over]==')'))
{
BreakPoint[begain][over]=-1;
if(begain+1>over-1)dp[begain][over]=0;
else dp[begain][over]=dp[begain+1][over-1];
}
for(point=begain; point<over; point++)(记录断点)
if(dp[begain][point]+dp[point+1][over]<dp[begain][over])
{
dp[begain][over]=dp[begain][point]+dp[point+1][over];
BreakPoint[begain][over]=point;
}
}
print(0,len-1);
printf("\n");
}
return 0;
}
(递归输出函数)
void print(int begain, int over)
{
if(begain>over)return ;
if(begain==over)
{
if(str[begain]=='('||str[begain]==')')printf("()");
else printf("[]");
return;
}
if(BreakPoint[begain][over]==-1)
{
printf("%c", str[begain]);
print(begain+1,over-1);
printf("%c", str[over]);
}
else
{
print(begain,BreakPoint[begain][over]);
print(BreakPoint[begain][over]+1, over);
}
}