uva 1368 坑爹贪心

来源：互联网发布：软件测试说明书实例编辑：程序博客网时间：2024/05/23 02:24

http://acm.bnu.edu.cn/v3/contest_show.php?cid=5772#problem/I

给定m个长度为n的DNA序列，求一个DNA序列，使其到所有序列的总差异尽量小，输出字典序最小。

一次看每一位的m个字符，贪心选取出现次数最多的，优先字典序小的.

#include <cstdio>#include <cstdlib>#include <cmath>#include <cstring>#include <string>#include <queue>#include <map>#include <iostream>#include <sstream>#include <algorithm>using namespace std;#define RD(x) scanf("%d",&x)#define RD2(x,y) scanf("%d%d",&x,&y)#define RD3(x,y,z) scanf("%d%d%d",&x,&y,&z)#define clr0(x) memset(x,0,sizeof(x))#define clr1(x) memset(x,-1,sizeof(x))typedef long long LL;struct DNA{int a,c,g,t;}d[1005];int main(){int t,n,m,i,j,ans,max;char s[1005];RD(t);while(t--){    RD2(n,m);    clr0(d);for(i=0;i<n;i++){            scanf("%s",s);            for(j=0;j<m;j++)                if(s[j]=='A') d[j].a++;                else if(s[j]=='C') d[j].c++; else if(s[j]=='G') d[j].g++;                else d[j].t++;}for(ans=i=0;i<m;i++){s[i]='A';max=d[i].a;if(d[i].c>max) s[i]='C',max=d[i].c;if(d[i].g>max) s[i]='G',max=d[i].g;if(d[i].t>max) s[i]='T',max=d[i].t;ans+=n-max;}s[m]=0;printf("%s\n%d\n",s,ans);}return 0;}

0 0