Codeforces Round #378 (Div. 2)A. Grasshopper And the String

链接：http://codeforces.com/contest/733/problem/A

题意：给定一个字符串，一只蚱蜢从左边跳到右边，每次只能跳到'A','E','I','O','U','Y'上。求最小的最大需要跳的距离。

分析：模拟

代码：

#include<map>
#include<set>
#include<stack>
#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;
typedef double db;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
const db eps=1e-5;
const int N=1e6+10;
const int M=1e5+10;
const ll MOD=1000000007;
const int mod=1000000007;
const int MAX=1000000010;
const double pi=acos(-1.0);
char s[110];
int main()
{
int i,len,last,ans=0;
scanf("%s", s);
last=0;len=strlen(s);
for (i=1;i<=len;i++)
if (s[i-1]=='A'||s[i-1]=='E'||s[i-1]=='I'||s[i-1]=='O'||s[i-1]=='U'||s[i-1]=='Y') {
ans=max(ans,i-last);last=i;
}
ans=max(ans,len+1-last);
printf("%d\n", ans);
return 0;
}