CodeForces - 977B：Two-gram（字符串匹配）

链接：https://vjudge.net/problem/CodeForces-977B

题目
Two-gram is an ordered pair (i.e. string of length two) of capital Latin letters. For example, “AZ”, “AA”, “ZA” — three distinct two-grams.

You are given a string consisting of capital Latin letters. Your task is to find any two-gram contained in the given string as a substring (i.e. two consecutive characters of the string) maximal number of times. For example, for string = “BBAABBBA” the answer is two-gram “BB”, which contained in three times. In other words, find any most frequent two-gram.

Note that occurrences of the two-gram can overlap with each other.

题意
求出现最多次数的子序列，要求子序列长度为2.

思路
还没到KMP的份，直接暴力就能过。
伊丽莎白！

代码

#include<bits/stdc++.h>
using namespace std;
int main()
{
    string ss;
    int maxt=0;
    int n;
    string s;
    cin>>n;
    cin>>s;
    for(int i=0; i<n-1; i++)
    {
        string t=s.substr(i,2);
        int ans=1;
        for(int j=i+1; j<n-1; j++)
        {
            string tmp=s.substr(j,2);
            if(t==tmp)
                ans++;
        }
        if(ans>maxt)
            ss=t,maxt=ans;
    }
    cout<<ss<<endl;
}

又是平静的一天~