[POJ1598]Excuses, Excuses!（模拟）

题目链接：http://poj.org/problem?id=1598

题意：给一个词典，然后给一些字符串，问这些字符串里出现多少次词典中出现的词，输出包含最多的字符串（可有多个）。

简单模拟，练手

#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <climits>
#include <complex>
#include <cassert>
#include <cstdio>
#include <bitset>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <ctime>
#include <set>
#include <map>
#include <cmath>
using namespace std;

const int maxn = 55;
const int maxm = 88;

int k, e;
set<string> ex;
vector<pair<string, string> > s;
int vis[maxn], ret;
char tmp[maxm], buf[maxm];

void gao(string cur, int pos) {
    int tt = 0;
    int l = 0, r = 0;
    while(r < cur.length()) {
        while(cur[r] == ' ') r++;
        l = r;
        while(cur[r] != ' ' && r < cur.length()) r++;
        int p = 0;
        memset(buf, 0, sizeof(buf));
        for(int i = l; i < r; i++) buf[p++] = cur[i];
        if(ex.find(buf) != ex.end()) tt++;
        l = r;
    }
    vis[pos] = tt;
    if(ret < tt) ret = tt;
}

int main() {
    // freopen("in", "r", stdin);
    int _ = 1;
    while(~scanf("%d%d",&k,&e)) {
        ex.clear(); s.clear();
        for(int i = 0; i < k; i++) {
            scanf("%s", tmp);
            ex.insert(tmp);
        }
        getchar();
        for(int i = 0; i < e; i++) {
            gets(tmp);
            memset(buf, 0, sizeof(buf));
            int p = 0;
            for(int j = 0; tmp[j]; j++) {
                if(tmp[j] >= 'A' && tmp[j] <= 'Z') buf[p++] = tmp[j] - 'A' + 'a';
                else if(!(tmp[j] >= 'a' && tmp[j] <= 'z')) buf[p++] = ' ';
                else buf[p++] = tmp[j];
            }
            s.push_back(pair<string, string>(tmp, buf));
        }
        memset(vis, 0, sizeof(vis));
        ret = 0;
        for(int i = 0; i < e; i++) gao(s[i].second, i);
        printf("Excuse Set #%d
", _++);
        for(int i = 0; i < e; i++) {
            if(vis[i] == ret) cout << s[i].first << endl;
        }
        printf("
");
    }
    return 0;
}