zoj 1027 dp

    这个跟最长公共子序列差不多..每次都有三种情况(1,匹配,2,第一个用'-'代替,3第二个用'-'代替)....只能挑选一种(子问题独立)..然后让你选择...有点小郁闷刚开始想错的地方就是

注释的那点..总是弄反,其实举个例子就能推翻 

第一个序列 1 A-

第二个序列 2 BA

当假设这样匹配的时候,,匹配到第二个位置,显然dp[i][j]=dp[i][j-1]+map['-'][ b[j] ],刚开始想反了..然后它给的数据刚好一组过,一组不过..就以为是别处的问题呢...

状态方程就是  dp[i][j] = max(dp[i-1][j-1]+map[i][j],dp[i-1][j]+map[a[i]]['-'],dp[i][j-1]+map['-'][b[j]]);

#include <stdio.h> #include <string.h> #define MAX 250 int GetNum(char c) { switch (c){ case 'A' :return 0; case 'C' :return 1; case 'G' :return 2; case 'T' :return 3; default: return 4; } } int max(int a,int b) {return a>b?a:b;} int max2(int a,int b,int c) {return max(a,max(b,c));} int main(void) { int len1,len2; int dp[MAX][MAX]; char a[MAX],b[MAX]; int T; int map[5][5] = { {5,-1,-2,-1,-3}, {-1,5,-3,-2,-4}, {-2,-3,5,-2,-2}, {-1,-2,-2,5,-1}, {-3,-4,-2,-1,0}, }; scanf("%d",&T); while (T--) { dp[0][0] = 0; //memset(dp,0,sizeof(dp)); scanf("%d %s",&len1,a+1); scanf("%d %s",&len2,b+1); a[len1+1] = b[len2+1] = '-'; for(int i=1;i<=len1;i++) dp[i][0] = dp[i-1][0]+map[4][ GetNum(a[i]) ]; for(int j=1;j<=len2;j++) dp[0][j] = dp[0][j-1]+map[GetNum(b[j])][4]; for(int i=1;i<=len1;i++) for(int j=1;j<=len2;j++) { int tmp1 = dp[i-1][j-1] + map[ GetNum(a[i]) ][ GetNum(b[j]) ]; //int tmp3 = dp[i][j-1] + map[ GetNum(a[i]) ][4]; //int tmp2 = dp[i-1][j] + map[ 4 ][ GetNum(b[j]) ]; int tmp2 = dp[i][j-1] + map[ 4 ][ GetNum(b[j]) ]; int tmp3 = dp[i-1][j] + map[ GetNum(a[i]) ][4]; dp[i][j] = max2(tmp1,tmp2,tmp3); } printf("%d/n",dp[len1][len2]); } return 0; }