uva1368 - DNA Consensus String

链接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4114

code

#include<stdio.h>

char DNAs[55][1005];
char result[1005];
int main()
{

	int caseN;
	scanf("%d",&caseN);
	while(caseN--)
	{
		int m,n;
		scanf("%d %d",&m,&n);
		for(int i = 0 ; i < m ; i ++)
			scanf("%s",DNAs[i]);
		int numberA,numberC,numberT,numberG;
	
		int diff = 0;
		for(int j = 0 ; j < n ; j ++)
		{
			numberA = numberC = numberG = numberT = 0;
			for(int i = 0 ; i < m; i ++)
			{
				switch(DNAs[i][j])
				{
				case 'A': numberA++; break;
				case 'C': numberC++; break;
				case 'G': numberG++; break;
				case 'T': numberT++; break;
				}
			}
			char ch;
			if(numberA >= numberC && numberA >= numberG && numberA >= numberT)
			{	ch = 'A'; diff += m - numberA;}
			if(numberC > numberA && numberC >= numberG && numberC >= numberT)
			{	ch = 'C'; diff += m - numberC;}
			if(numberG > numberC && numberG > numberA && numberG >= numberT)
			{	ch = 'G'; diff += m - numberG;}
			if(numberT > numberC && numberT > numberG && numberT > numberA)
			{	ch = 'T'; diff += m - numberT;}
			result[j] = ch;
		}
		for(int i = 0 ; i < n ; i ++)
			printf("%c",result[i]);
		printf("\n%d\n", diff);
	}

	return 0;
}

注意事项：

1）一开始对题目的理解没对位，以为是很复杂的字符串比较，后来从其他人那学习了方法，其实只要计算每一列出现最多的字母是哪一个，然后由这些出现最多字母组成的字符串肯定就是距离所有距离最短的字符串。