2018湘潭大学程序设计竞赛【B】

题目链接： https://www.nowcoder.com/acm/contest/105/B

题意： 给你一个字母矩阵，和测试组数，让你统计字符串的字符累计出现的次数，然后让你找出需要找的字符，这个字符必须是每行每列里出现次数最多的。

题解： 暴力瞎搞。map列举一下啊。写的十分暴力，绝对不是最优解。QAQ。题好难读，看了好久才懂样例。

 #include<iostream>
 #include<string>
 #include<cstring>
 #include<cstdio>
 #include<map>
 using namespace std;
 int a[][];
 int h[];
 int l[];
 int maxh;
 int maxl;
 map<int,char> m;

 void init(){
     m[] = '';m[] = '';m[] = '';m[] = '';m[] = '';m[] = '';
     m[] = '';m[] = '';m[] = '';m[] = '';m[] = 'A';m[] = 'B';
     m[] = 'C';m[] = 'D';m[] = 'E';m[] = 'F';m[] = 'G';m[] = 'H';
     m[] = 'I';m[] = 'J';m[] = 'K';m[] = 'L';m[] = 'M';m[] = 'N';
     m[] = 'O';m[] = 'P';m[] = 'Q';m[] = 'R';m[] = 'S';m[] = 'T';
     m[] = 'U';m[] = 'V';m[] = 'W';m[] = 'X';m[] = 'Y';m[] = 'Z';
 }

 int main(){
     init();
     int n;
     cin >> n;
     while(n--){
         memset(a,,sizeof(a));
         memset(h,,sizeof(h));
         memset(l,,sizeof(l));
         maxh=;
         maxl=;
         string s;
         cin >> s;
         for(int i=;i<s.size();i++){
             if(s[i]=='')   a[][]++;
             if(s[i]=='')   a[][]++;
             if(s[i]=='')   a[][]++;
             if(s[i]=='')   a[][]++;
             if(s[i]=='')   a[][]++;
             if(s[i]=='')   a[][]++;
             if(s[i]=='')   a[][]++;
             if(s[i]=='')   a[][]++;
             if(s[i]=='')   a[][]++;
             if(s[i]=='')   a[][]++;
             if(s[i]=='A')   a[][]++;
             if(s[i]=='B')   a[][]++;
             if(s[i]=='C')   a[][]++;
             if(s[i]=='D')   a[][]++;
             if(s[i]=='E')   a[][]++;
             if(s[i]=='F')   a[][]++;
             if(s[i]=='G')   a[][]++;
             if(s[i]=='H')   a[][]++;
             if(s[i]=='I')   a[][]++;
             if(s[i]=='J')   a[][]++;
             if(s[i]=='K')   a[][]++;
             if(s[i]=='L')   a[][]++;
             if(s[i]=='M')   a[][]++;
             if(s[i]=='N')   a[][]++;
             if(s[i]=='O')   a[][]++;
             if(s[i]=='P')   a[][]++;
             if(s[i]=='Q')   a[][]++;
             if(s[i]=='R')   a[][]++;
             if(s[i]=='S')   a[][]++;
             if(s[i]=='T')   a[][]++;
             if(s[i]=='U')   a[][]++;
             if(s[i]=='V')   a[][]++;
             if(s[i]=='W')   a[][]++;
             if(s[i]=='X')   a[][]++;
             if(s[i]=='Y')   a[][]++;
             if(s[i]=='Z')   a[][]++;
         }

         for(int i =  ; i <  ; i++){
             int sum = ;
             for(int j =  ; j < ; j++)
                 sum += a[i][j]; 

             h[i] = sum;
         }

         for(int i =  ; i < ; i++){
             int sum = ;
             for(int j =  ; j < ; j++)
                 sum += a[j][i];

             l[i] = sum;
         }

         for(int i =  ; i < ; i++){
             if(h[i] > maxh)
                 maxh = h[i];
             if(l[i] > maxl)
                 maxl = l[i];
         }

         //cout << maxh <<" " << maxl << endl;
         for(int i =  ; i < ; i++){
             for(int j = ; j < ; j++){
                 //cout << h[i] << " " << l[j]<<endl;
                 if(h[i] == maxh && l[j] == maxl){
                     int cnt = i*+j;
                     printf("%c",m[cnt]);
                 }
             }
         }
         cout << endl;
     }
 }