#2784. ATCoder
ATCoder
ATCoder
题目描述
You are given a string consisting of uppercase English letters. Find the length of the longest ACGT string that is a substring (see Notes) of . Here, a ACGT string is a string that contains no characters other than , , and .
输入格式
Input is given from Standard Input in the following format:
输出格式
Print the length of the longest ACGT string that is a substring of .
ATCODER
3
HATAGAYA
5
SHINJUKU
0
提示
is a string of length between and (inclusive).
Each character in is an uppercase English letter.A substring of a string is a string obtained by removing zero or more characters from the beginning and the end of .
For example, the substrings of include , , , and $$ (the empty string), but not .Among the ACGT strings that are substrings of , the longest one is .
Among the ACGT strings that are substrings of , the longest one is .
Among the ACGT strings that are substrings of , the longest one is $$ (the empty string).
标签: AtCoder|abc122B
来源
AtCoder|abc122B