UVA 409 Excuses, Excuses!

输入一些单词，统计之后输入的句子分别含多少个单词，输出最多的，如果有多个，就都输出，任意序都行。

#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<string>
#include<cmath>
#include<map>
///LOOP
#define REP(i, n) for(int i = 0; i < n; i++)
#define FF(i, a, b) for(int i = a; i < b; i++)
#define FFF(i, a, b) for(int i = a; i <= b; i++)
#define FD(i, a, b) for(int i = a - 1; i >= b; i--)
#define FDD(i, a, b) for(int i = a; i >= b; i--)
///INPUT
#define RI(n) scanf("%d", &n)
#define RII(n, m) scanf("%d%d", &n, &m)
#define RIII(n, m, k) scanf("%d%d%d", &n, &m, &k)
#define RIV(n, m, k, p) scanf("%d%d%d%d", &n, &m, &k, &p)
#define RV(n, m, k, p, q) scanf("%d%d%d%d%d", &n, &m, &k, &p, &q)
#define RFI(n) scanf("%lf", &n)
#define RFII(n, m) scanf("%lf%lf", &n, &m)
#define RFIII(n, m, k) scanf("%lf%lf%lf", &n, &m, &k)
#define RFIV(n, m, k, p) scanf("%lf%lf%lf%lf", &n, &m, &k, &p)
#define RS(s) scanf("%s", s)
///OUTPUT
#define PN printf("\n")
#define PI(n) printf("%d\n", n)
#define PIS(n) printf("%d ", n)
#define PS(s) printf("%s\n", s)
#define PSS(s) printf("%s ", n)
#define PC(cas) printf("Excuse Set #%d\n", cas)
///OTHER
#define PB(x) push_back(x)
#define CLR(a, b) memset(a, b, sizeof(a))
#define CPY(a, b) memcpy(a, b, sizeof(b))
#define display(A, n, m) {REP(i, n){REP(j, m)PIS(A[i][j]);PN;}}

using namespace std;
typedef long long LL;
typedef pair<int, int> P;
const int MOD = 1000000;
const int INFI = 1e9 * 2;
const LL LINFI = 1e17;
const double eps = 1e-6;
const double pi = acos(-1.0);
const int N = 88;
const int M = 33;
const int move[8][2] = {0, 1, 0, -1, 1, 0, -1, 0, 1, 1, 1, -1, -1, 1, -1, -1};

struct node
{
    char s1[N];
    int num;
}p[M];

bool cmp(node a, node b)
{
    return a.num > b.num;
}

map<string, int> mm;
char s[N], tmp[M];

int main()
{
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);

    int n, m, l, lt, cas = 1;
    while(RII(n, m) != EOF)
    {
        mm.clear();
        REP(i, n)
        {
            RS(s);
            l = strlen(s);
            REP(j, l)s[j] = tolower(s[j]);
            mm[s] = 1;
        }
        getchar();
        REP(i, m)
        {
            gets(s);
            p[i].num = 0;
            strcpy(p[i].s1, s);
            l = strlen(s);
            REP(j, l)
            {
                if(isalpha(s[j]))
                {
                    lt = 0;
                    CLR(tmp, 0);
                    while(isalpha(s[j]) && j < l)tmp[lt++] = tolower(s[j++]);
                    tmp[lt++] = '\0';
                    if(mm[tmp])p[i].num++;
                }
            }
        }
        sort(p, p + m, cmp);
        PC(cas++);
        REP(i, m - 1)
        {
            if(p[i].num == p[0].num)puts(p[i].s1);
            else break;
        }
        puts("");
    }
    return 0;
}