Problem:
Score : 200 points

Problem Statement

You are given a string S consisting of uppercase English letters. Find the length of the longest ACGT string that is a substring (see Notes) of S.

Here, a ACGT string is a string that contains no characters other than A, C, G and T.

Notes

A substring of a string T is a string obtained by removing zero or more characters from the beginning and the end of T.

For example, the substrings of ATCODER include TCO, AT, CODER, ATCODER and (the empty string), but not AC.

Constraints

S is a string of length between 1 and 10 (inclusive).

Each character in S is an uppercase English letter.

Input

Input is given from Standard Input in the following format:

S

Output

Print the length of the longest ACGT string that is a substring of S.

Sample Input 1

ATCODER

Sample Output 1

3

Among the ACGT strings that are substrings of ATCODER, the longest one is ATC.

Sample Input 2

HATAGAYA

Sample Output 2

5

Among the ACGT strings that are substrings of HATAGAYA, the longest one is ATAGA.

Sample Input 3

SHINJUKU

Sample Output 3

0

Among the ACGT strings that are substrings of SHINJUKU, the longest one is (the empty string).

Solution in C (GCC 5.4.1) (judge verdict: Accepted)

#include<stdio.h>
#include<stdlib.h>

int main(void){

    char S[11];
    int T[11] = {0};
    int X[11] = {0};
    scanf("%s", S);
    
    int i, j;
    int max_s = -1;
    int max_e = -1;
    int max_len = 0;
    for(i=0; S[i]!='\0'; i++) {
        if(S[i] == 'A' || S[i] == 'C' || S[i] == 'G' || S[i] == 'T'){
            T[i] = 1;
        }
    }

    i = 0;
    while(S[i] !='\0') {
        // 同じ場所から順に右に探索
        if(T[i] == 1) {
           // printf("nice !S[%d] = %c\n", i, S[i]); 
           for(j=i; S[j]!='\0'; j++) {
               if(T[j] == 1) {
                   // printf("T[%d] = 1\n", j);
                   if(j - i + 1 > max_len) {
                       max_len = j - i + 1;
                       max_s = i;
                       max_e = j;
                       // printf("kiroku kousin\n");
                    }
               }
               else{
                   i++;
                   // printf("quit, next\n");
                   break;
               }
           }
           i++;
           // printf("searching end. next i\n");
        }
        else{
           // printf("S[%d] = %c, zannen\n", i, S[i]); 
            i++;
        }
    }

    //printf("%d, %d, %d\n", max_s, max_e, max_len);
    printf("%d\n", max_len);

    return 0;
}