2016 ICPC 北京网络赛C题A Simple Job，hiho1385 : A Simple Job

链接：http://hihocoder.com/problemset/problem/1385

题意：给定一个英语文本，求出现频率最大的字典序最小的词组是哪个。

分析：直接模拟即可。

代码：

#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<bitset>
#include<math.h>
#include<vector>
#include<string>
#include<stdio.h>
#include<cstring>
#include<iostream>
#include<algorithm>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
const int N=510;
const int M=50010;
const int mod=1000000007;
const int MOD1=1000000007;
const int MOD2=1000000009;
const double EPS=0.00000001;
typedef long long ll;
const ll MOD=1000000007;
const int INF=1000000010;
const ll MAX=1ll<<55;
const double eps=1e-5;
const double inf=~0u>>1;
const double pi=acos(-1.0);
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
string s,pre,sub,ans,now;
map<string,int>MA;
int main()
{
    int i,bo,mx,len;
    MA.clear();ans="";mx=0;
    while (getline(cin,s)) {
        if (s=="####") {
            cout<<ans<<":"<<mx<<endl;
            MA.clear();ans="";mx=0;
        } else {
            pre="";sub="";bo=0;
            len=s.size();
            for (i=0;i<=len;i++)
            if (i>0&&s[i]==' '&&s[i-1]==' ') continue ;
            else {
                if (s[i]==' '||s[i]==','||s[i]=='.'||i==len) {
                    if (pre!=""&&sub!=""&&bo) {
                        now=pre+" "+sub;
                        MA[now]++;
                        if (MA[now]==mx) ans=min(ans,now);
                        if (MA[now]>mx) ans=now,mx=MA[now];
                    }
                    if (s[i]==' ') {
                        bo=1;pre=sub;sub="";
                    } else {
                        bo=0;pre="";sub="";
                    }
                } else sub=sub+s[i];
            }
        }
    }
    return 0;
}