Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

我的AC了,哈哈!贴下。

Posted by alfredzzj at 2010-08-29 23:45:03 on Problem 1080
#include<iostream>
#include<string>
#include<vector>
using namespace std;
char a[101],b[101];
int dp[101][101];
int match[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,-10};
int max(int x,int y,int z)
{
	return (x>y?x:y)>z?(x>y?x:y):z;
}
int pos(char ch)
{
	if(ch=='A')
		return 0;
	else if(ch=='C')
		return 1;
	else if(ch=='G')
		return 2;
	else if(ch=='T')
		return 3;
	else if(ch=='-')
		return 4;
}
int main()
{
	string str1,str2;
	int i,j,num;
	cin>>num;
	while(num--)
	{
		int m,n;
		cin>>m>>str1>>n>>str2;
		for(i=0;i<str1.length();i++)
				a[i]=str1[i];
		for(i=0;i<str2.length();i++)
				b[i]=str2[i];
		dp[0][0]=0;
		for(i=1;i<=n;i++)
			dp[0][i]=dp[0][i-1]+match[pos(b[i-1])][pos('-')];
		for(i=1;i<=m;i++)
			dp[i][0]=dp[i-1][0]+match[pos(a[i-1])][pos('-')];
		for(i=1;i<=m;i++)
			for(j=1;j<=n;j++)
				dp[i][j]=max(dp[i-1][j-1]+match[pos(a[i-1])][pos(b[j-1])],dp[i][j-1]+match[pos(b[j-1])][pos('-')],dp[i-1][j]+match[pos(a[i-1])][pos('-')]);  
		cout<<dp[m][n]<<endl;
	}
	return 0;
}

Followed by:

Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator