CodeForces 733A - Grasshopper And the String

题目大意： 对于给定的一个字符串序列，找到最大的两个元音字符之间的距离

我们可以比较容易的得到公式

$$\it {f(x)=\begin{cases} now=0 , & \text{s[i] is vowels} \\ now+=1, &\text{s[i] is not a vowels} \end{cases}}$$

然后遍历字符串即可。需要的特殊处理末尾

#include <cstdio>
#include <string>
#include<iostream>
#include<vector>
#include <stack>
#include <queue>
#include <map>
#include <cstdlib>
#include<string.h>
#include <cstring>
#include <algorithm>

using namespace std;

typedef long long ll;
typedef pair<int, int>pii;
typedef pair<ll, ll> pll;
typedef pair<int, ll> pil;

bool cheak(char s)
{
    if (s == 'A' || s == 'E' || s == 'O' || s == 'U' || s == 'I' || s == 'Y')return true;
    else return false;
}

int main()
{
    string s;
    cin >> s;
    int maxx = 0;
    int now = 0;
    s += ' ';
    for (int i = 0; i < s.size(); i++)
    {
        now++;
        maxx = max(maxx, now);
        if (cheak(s[i]))now = 0;;
    }
    cout << maxx << endl;
    //system("pause");
}