1080 Human Gene Functions 解题报告

AccecptTime:  2009-02-04 01:16:09Language: G++Memory:  996KTime:  16 msErrors:  2 waAlgorithm: DP

 

 

又做了一道dp题,这题之前在书上看过.写起来很快,但是有一个初始化条件没写好.导致了两次wa.

继续贴代码~

#include <stdio.h>#include <iostream>using namespace std;#define N 105int Max(int a,int b,int c){return max(a,max(b,c));}int col(char a,char b){if(a==b)return 5;if(a>b&&b!='-')swap(a,b);switch(a){case 'A':if(b=='G')return -2; elseif(b=='-')return -3; else return -1;case 'C':if(b=='T')return -2; elseif(b=='G')return -3; elsereturn -4;case 'G':return -2;case 'T':return -1;}//it shouldn't go here return 0;}char dna1[N],dna2[N];int len1,len2;void input(){scanf("%d%s",&len1,dna1);scanf("%d%s",&len2,dna2);}int dp(){int d[N][N];d[0][0]=0;//这里的两个初始化要注意一下for(int i = 1; i <= len1; i++)d[i][0]=d[i-1][0]+col(dna1[i-1],'-');for(int i = 1; i <= len2; i++)d[0][i]=d[0][i-1]+col(dna2[i-1],'-');for(int i = 1; i <= len1; i++)for(int j = 1; j <= len2; j++)if(dna1[i-1]==dna2[j-1])d[i][j]=d[i-1][j-1]+5;elsed[i][j]=Max(d[i][j-1]+col(dna2[j-1],'-'),d[i-1][j]+col(dna1[i-1],'-'),d[i-1][j-1]+col(dna1[i-1],dna2[j-1]));return d[len1][len2];}int main(){int n;scanf("%d",&n);while(n--){input();printf("%d/n",dp());}return 0;}

 

有点困了,在写一题就睡了zzZZ..