poj解题报告——1080

最新推荐文章于 2022-02-23 15:02:25 发布

原创最新推荐文章于 2022-02-23 15:02:25 发布 · 471 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#c #poj

收录于

poj 同时被 2 个专栏收录

130 篇文章

订阅专栏

动态规划

24 篇文章

订阅专栏

本文探讨了利用动态规划解决序列匹配问题的方法，通过构建状态转移方程，实现序列之间的匹配并求解最大得分。代码示例展示了如何初始化矩阵、遍历序列并计算得分，最终输出最优匹配结果。

这种题目总是要先打表，再化归，dp问题，取最大。

代码如下

#include<stdio.h>
#include<string.h>
#define N 1005
int dp[N][N];
int score[200][200];
int max(int a,int b)
{
	return a>b?a:b;
}
void init() 
{
	score['A']['A']=score['C']['C']=score['G']['G']=score['T']['T']=5;
	score['A']['C']=score['C']['A']=-1;
	score['A']['G']=score['G']['A']=-2;
	score['A']['T']=score['T']['A']=-1;
	score['A']['-']=score['-']['A']=-3;
	score['C']['G']=score['G']['C']=-3;
	score['C']['T']=score['T']['C']=-2;
	score['C']['-']=score['-']['C']=-4;
	score['G']['T']=score['T']['G']=-2;
	score['G']['-']=score['-']['G']=-2;
	score['T']['-']=score['-']['T']=-1;
	score['-']['-']=0;
}
void main () 
{
	int t,n,m,i,j,t1,t2,t3,maxn;
	char s1[N];
	char s2[N];
	init();
	scanf("%d",&t);
	while(t--)
	{
		memset(dp,0,sizeof(dp));
		scanf("%d %s",&n,s1);
		scanf("%d %s",&m,s2);
		for(i=1;i<=n;i++)
			dp[i][0]=dp[i-1][0]+score[s1[i-1]]['-'];
		for(j=1;j<=m;j++)
			dp[0][j]=dp[0][j-1]+score['-'][s2[j-1]];
		for(i=1;i<=n;i++) 
		{
			for(j=1;j<=m;j++) 
			{
				t1=dp[i-1][j]+score[s1[i-1]]['-'];
				t2=dp[i][j-1]+score['-'][s2[j-1]];
				t3=dp[i-1][j-1]+score[s1[i-1]][s2[j-1]];
				maxn=max(t1,t2);
				dp[i][j]=max(maxn,t3);
			}
		}
		printf("%d\n",dp[n][m]);
	}
}