PKUACM_HUMAN GENE FUNCTION
来源:互联网 发布:c语言window库函数大全 编辑:程序博客网 时间:2024/05/22 05:26
#include <stdio.h>
//返回两个字符的匹配值
int table(char a,char b)
{
if(a==b)
return 5;
if(a=='A'&&b=='C'||a=='C'&&b=='A'||a=='A'&&b=='T'||a=='T'&&b=='A'||a=='T'&&b=='-'||a=='-'&&b=='T')
return -1;
if(a=='A'&&b=='G'||a=='G'&&b=='A'||a=='C'&&b=='T'||a=='T'&&b=='C'||a=='G'&&b=='-'||a=='-'&&b=='G'||a=='G'&&b=='T'||a=='T'&&b=='G')
return -2;
if(a=='G'&&b=='C'||a=='C'&&b=='G'||a=='A'&&b=='-'||a=='-'&&b=='A')
return -3;
else
return -4;
}
//4个整数的最大值
int max(int a,int b,int c)
{
return a>(c>b?c:b)?a:(c>b?c:b);
}
int main1(void)
{
//opt[i][j]记录字符串a中的前i个字符与字符串b中的前j个字符匹配所产生的最大值
int count,num1,num2,opt[101][101],i,j;
char a[101],b[101];
scanf("%d",&count);
while(count>0)
{
scanf("%d%s%d%s",&num1,a,&num2,b);
opt[0][0] = 0;
for(i=1;i<=num1;i++)
opt[0][i] = opt[0][i-1]+table('-',a[i-1]);
for(i=1;i<=num2;i++)
opt[i][0] = opt[i-1][0]+table('-',b[i-1]);
for(i=1;i<=num2;i++)
for(j=1;j<=num1;j++)
opt[i][j] = max(opt[i-1][j-1]+table(b[i-1],a[j-1]),opt[i][j-1]+table('-',a[j-1]),opt[i-1][j]+table('-',b[i-1]));
printf("%s/n",&a);
printf("%d/n",opt[num2][num1]);
count-- ;
}
return 1;
}
- PKUACM_HUMAN GENE FUNCTION
- PUKOJ1080 Humman Gene Function
- Pku 1080 Humman Gene Function
- POJ 1080 HUMAN GENE FUNCTION
- POJ 1080 Humman Gene Function
- POJ 1080--Human Gene Function
- Pku 1080 Humman Gene Function 解题分析
- PKU ACM 1080-human gene function
- Pku 1080 Humman Gene Function 解题分析
- poj1080——human gene function
- 【算法刷题】poj 1080 Human Gene Function
- Pku acm 1080 Humman Gene Function 动态规划题目解题报告(八)
- Gene Assembly
- Gene Shuffle
- zoj1027 Human Gene Functions
- 1080 Human Gene Functions
- PKU1080 Human Gene Functions
- Human Gene Functions(POJ1080)
- m2eclipse: Eclipse is running in a JRE, but a JDK is required
- Linux小技巧收集
- vsftp配置大全...
- 深入探索透视纹理映射(下)
- mount or unmount
- PKUACM_HUMAN GENE FUNCTION
- 有道理1
- pku 2186(强连通分量)
- WINCE音量调节的实现
- PKU ACM 1004
- PKU ACM 1045
- 黑莓&苹果──两种水果的美味生活(转载)
- 郁闷~~~~~~~~~·
- 从头再学C语言:getchar原来是这样的。