一类DP算法

DP应该是一种简单高效优美的算法，实在令人兴奋，近日在CSDN上解了几个问题，

 

发觉其实都接近同一类的DP问题，基本上的写法接近一种模式。

 

 

问题1： 式子上添加括号的最大值 (只有 +,-,*)

 

1+2*3这个例子
(1+2)*3=9这样算比1+(2*3)=7出来的结果要来得大
所以解答应为9

3*5+4这个例子
3*(5+4)=27这样算比(3*5)+4=19出来的结果要来得大
所以解答应为27

 

要点:把最大最小的都保存下来，中间可能出现负负得正

max[i][j]=当前数 (if i=j)
max[i][j]=max{max[i][k] op[k] max[k+1][j]} (if i <j)

 

min[i][j]=当前数 (if i=j)
min[i][j]=min{min[i][k] op[k] min[k+1][j]} (if i <j)

 

 

#include<ctype.h> #include<stdio.h> #include<string.h> #include<stdlib.h> #define MAX_LEN 10 char str[128]; char hash[128]; int op[MAX_LEN]; int num[MAX_LEN]; int DP_FLAG[MAX_LEN][MAX_LEN]; int max_min[MAX_LEN][MAX_LEN][2]; void DFS(int a,int b) { int i,j,k,h; int tmin,tmax,temp; tmin = 0x7fffffff; // 2147483647 tmax = 0x80000001; // -2147483647 for(i = 0;i+a<b;i++) { j = (a+i+a+i+1)/2; if(DP_FLAG[a][a+i] == 0) DFS(a,a+i); if(DP_FLAG[a+i+1][b] == 0) DFS(a+i+1,b); for(k = 0;k<2;k++) { for(h = 0;h<2;h++) { if(op[j] == 1) temp = max_min[a][a+i][k]+max_min[a+i+1][b][h]; else if(op[j] == 2) temp = max_min[a][a+i][k]-max_min[a+i+1][b][h]; else temp = max_min[a][a+i][k]*max_min[a+i+1][b][h]; //应该放在里面(改) if(tmin>temp) tmin = temp; if(tmax<temp) tmax = temp; } } } DP_FLAG[a][b] = 1; max_min[a][b][0] = tmin; max_min[a][b][1] = tmax; } int main() { int i,j,len; int num_inc,op_inc; hash['+'] = 1; hash['-'] = 2; hash['*'] = 3; freopen("test.txt","r",stdin); while(scanf("%s",str)!=EOF) { len = strlen(str); num_inc = op_inc = 0; for(i=0;i<len;i++) { for(j = i;j<len;j++) { if(!isdigit(str[j])) { op[op_inc] = hash[str[j]]; num[num_inc] = atoi(str+i); op_inc++; num_inc++; i = j; break; } } if(j == len) { num[num_inc] = atoi(str+i); break; } } for(i=0;i<=num_inc;i++) { memset(DP_FLAG[i],0,sizeof(int)*(num_inc+1)); DP_FLAG[i][i] = 1; max_min[i][i][0] = num[i]; max_min[i][i][1] = num[i]; } DFS(0,num_inc); printf("%d/n",max_min[0][num_inc][1]); } return 0; }

 

 

 

 

问题2：括号的枚举

 

 

 

比如 P = a,b,c,d .
乘积方案有
(a(b(cd)))
(a((bc)d))
((ab)(cd))
(((ab)c)d)
((a(bc))d)

 

 

DP(n,m) = DP(n,n+inc) + DP(n+inc+1,m); {inc (0 到 n+inc <m)}

DP[][]保存list产生所有的组合，再按上边的通式合并就是结果了

其实，每个分段就是一个递归的过程,当中产生的子问的重叠，用flag[][]

作标记，就可以达到记忆化了,减少运算

 

#include<list> #include<string> #include<iostream> using namespace std; char str[64]; char flag[64][64]; string str1,str2,str3; list<string> DP[64][64]; list<string>::iterator st1,st2,st3,en1,en2; void DFS(int a,int b,int end) { int inc; for(inc = 0;a+inc<b;inc++) { if(flag[a][a+inc] == 0) DFS(a,a+inc,end); //左部份 if(flag[a+inc+1][b] == 0) DFS(a+inc+1,b,end); //右部份 st1 = DP[a][a+inc].begin(); en1 = DP[a][a+inc].end(); st3 = DP[a+inc+1][b].begin(); en2 = DP[a+inc+1][b].end(); for(;st1!=en1;st1++) //左右合并 { str1 = (*st1); for(st2 = st3;st2!=en2;st2++) { str2 = (*st2); str3 = "(" + str1 + str2 + ")"; DP[a][b].push_back(str3); } } } flag[a][b] = 1; //子问题标记 } int main() { int len,i,j; freopen("test.txt","r",stdin); while(cin>>str) { len = strlen(str); memset(flag,0,sizeof(char)*64*64); for(i=0;i<len;i++) //初始化 { for(j=0;j<len;j++) DP[i][j].clear(); str1 = str[i]; flag[i][i] = 1; DP[i][i].push_back(str1); } DFS(0,len-1,len-1); } st1 = DP[0][len-1].begin(); en1 = DP[0][len-1].end(); for(;st1!=en1;st1++) //输出所有 cout<<(*st1)<<endl; return 0; }

 

 

 

问题3:Parenthesize the string

 

Parenthesize the string。
Description
Let us define a multiplication operation on three symbols a,b,c according to the following table; thus ab = b, ba = c, and so on. Notice that the multiplication operation defined by the table is neither associative nor commutative.          
 

   a b c
a b b a
b c b a
c a c c

Find an efficient algorithm that examines a string of these symbols, say bbbbac, and decides whether or not it is possible to parenthesize the string in such a way that the value of the resulting expression is a. For example , on input bbbbac your algorithm should return yes because ((b(bb))(ba))c = a.
Input
Line 1: number K (1 <= K <= 100)
Line 2 … K+1: each of them is a test string.
Output
Line 1 … K : For each test case, output Yes or No.
Sample Input
2
bbbbac
abb
Sample Output
Yes
No

 

 

题目的意思是，把一个字符串按上边的矩阵的结合方式，能不能最终转换成字符a

 

每次的中间结果只有a,b,c，所以得到通式

 

DP[i][j][3] = DP[i][k][3]+DP[k+1][j][3]; (i<j)

 

 

#include<stdio.h> #include<string.h> #include<stdlib.h> char temp[128]; char test[128][128]; char DP[101][101][4]; void DFS(int a,int b) { int inc,i,j,k; for(inc = 0;a+inc < b;inc++) { //子问题重叠 if(DP[a][a+inc][0] == 0) DFS(a,a+inc); if(DP[a+inc+1][b][0] == 0) DFS(a+inc+1,b); for(i=1;i<4;i++) //不小心越界了-_-! { if(DP[a][a+inc][i]) { for(j=1;j<4;j++) { if(DP[a+inc+1][b][j]) { k = test[i+'a'-1][j+'a'-1]; DP[a][b][k-'a'+1] = 1; } } } } } DP[a][b][0] = 1; //子问题遍历标记 } int main() { int m,i,j,len; test['a']['a'] = 'b'; test['a']['b'] = 'b'; test['a']['c'] = 'a'; test['b']['a'] = 'c'; test['b']['b'] = 'b'; test['b']['c'] = 'a'; test['c']['a'] = 'a'; test['c']['b'] = 'c'; test['c']['c'] = 'c'; while(scanf("%d",&m)!=EOF) { while(m--) { scanf("%s",temp); len = strlen(temp); for(i=0;i<=len;i++) for(j=0;j<=len;j++) memset(DP[i][j],0,sizeof(char)*4); for(i=0;i<len;i++) { DP[i][i][0] = 1; //子问题遍历标记 DP[i][i][ temp[i] -'a'+1] = 1; } DFS(0,len-1); if(DP[0][len-1][1]) printf("YES/n"); else printf("NO/n"); } } return 0; }