codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

733A.md (1490B)


      1 Source: https://codeforces.com/problemset/problem/733/A
      2 
      3 A. Grasshopper And the String
      4 
      5 time limit per test
      6 
      7 1 second
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 One day, the Grasshopper was jumping on the lawn and found a piece of paper with a string. Grasshopper became interested what is the minimum jump ability he should have in order to be able to reach the far end of the string, jumping only on vowels of the English alphabet. Jump ability is the maximum possible length of his jump.
     22 
     23 Formally, consider that at the begginning the Grasshopper is located directly in front of the leftmost character of the string. His goal is to reach the position right after the rightmost character of the string. In one jump the Grasshopper could jump to the right any distance from 1 to the value of his jump ability.
     24 
     25  ![](https://espresso.codeforces.com/c9bddfb78bb461141cbceccc6a5890fec0088928.png) The picture corresponds to the first example. 
     26 
     27 The following letters are vowels: 'A', 'E', 'I', 'O', 'U' and 'Y'.
     28 
     29 Input
     30 
     31 The first line contains non-empty string consisting of capital English letters. It is guaranteed that the length of the string does not exceed 100.
     32 
     33 Output
     34 
     35 Print single integer *a* — the minimum jump ability of the Grasshopper (in the number of symbols) that is needed to overcome the given string, jumping only on vowels.
     36 
     37 Examples
     38 
     39 Input
     40 
     41 ```
     42 ABABBBACFEYUKOTT
     43 ```
     44 
     45 Output
     46 
     47 ```
     48 4
     49 ```
     50 
     51 Input
     52 
     53 ```
     54 AAA
     55 ```
     56 
     57 Output
     58 
     59 ```
     60 1
     61 ```