UVA 1368 - DNA Consensus String(贪心)

题意：

思路：

[code]#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <cstdlib>
using namespace std;
typedef long long ll;
char dna[55][1010];
const char s[] = "ACGT";
int map[256];
char str[1010];

int m,n;
void init() {
    memset(map,0,sizeof(map));
    map['A'] = 0; map['C'] = 1;
    map['G'] = 2; map['T'] = 3;
}
int main() {
    init();
    int T;
    scanf("%d",&T);
    while(T--) {
        scanf("%d%d",&m,&n);
        for(int i = 0; i < m; i++) {
            scanf("%s",dna[i]);
        }
        int vis[5];
        int cnt = 0;
        for(int j = 0; j < n; j++) {
            memset(vis, 0,sizeof(vis));
            for(int i = 0; i < m; i++) {
                vis[map[dna[i][j]]]++;
            }
            int flag = 0;
            int Max = vis[0];
            for(int i = 0; i < 4; i++) {
                if(Max < vis[i]) {
                    Max = vis[i];
                    flag = i;
                }
            }
            str[j] = s[flag];
            cnt += (m - Max);
        }
        str
 = '\0';
        printf("%s\n",str);
        printf("%d\n",cnt);
    }
    return 0;
}