Problem: (A) Grasshopper And the String Solve Archive

Hi guys , i just tried the Grasshopper problem , hope you might like it . #include int main(){ char a;int k=-1,i,max=0,s; scanf(“%s”,a); for(i=0;a!=’\0′;i++) { if(a==’A’||a==’E’||a==’I’||a==’O’||a==’U’||a==’Y’) {s=i-k;k=i; if(s>max) max=s;} }s=i-k; if(s>max) max=s; printf(“%d”,max); return 0; …