pypy3(pypy3.6.1) 解法, 执行用时: 40ms, 内存消耗: 19076K, 提交时间: 2020-11-22 14:04:35

a = ['a','e','i','o','u']
T = int(input())
for _ in range(T):
    s = input()
    n = len(s)
    ans = 0
    i = 0
    while i<n:
        j = i
        if s[i] in a:
            while j < n and s[j] in a:
                j+=1
            ans = max(ans,j-i)
            i = j
        else:
            i = i + 1
    print(ans)

C++(clang++11) 解法, 执行用时: 2ms, 内存消耗: 376K, 提交时间: 2020-11-22 15:06:30

#include<bits/stdc++.h>
using namespace std;
int main(){
	int n;cin>>n;
	while(n--){
		char s[55];cin>>s;
		int sum=0,t;
		for(int i=0;i< strlen(s);i++){
				 t=0;
while((s[i]=='a'||s[i]=='e'||s[i]=='i'||s[i]=='u'||s[i]=='o')&&i< strlen(s)){
				t++;i++;
				}
            sum=max(sum,t);
		}cout<<sum<<"\n";
	}
}

Python3(3.9) 解法, 执行用时: 26ms, 内存消耗: 3448K, 提交时间: 2020-11-22 15:25:36

import re
for i in range(int(input())):
    a=input()
    aa=re.findall("[aeiou]*",a)
    print(max([len(i) for i in aa]))