#D. 最大的子串(Repetitions)

    Type: FileIO (repet) 1000ms 256MiB

最大的子串(Repetitions)

You cannot submit for this problem because the contest is ended. You can click "Open in Problem Set" to view this problem in normal mode.

Description

You are given a DNA sequence: a string consisting of characters A, C, G, and T. Your task is to find the longest repetition in the sequence. This is a maximum-length substring containing only one type of character.

Format

Input

The only input line contains a string of n characters.

Output

Print one integer: the length of the longest repetition.

Samples

ATTCGGGA
3

Limitation

  • 1n10610^6
  • Time limit: 1.00 s
  • Memory limit: 512 MB

训练题单一

Not Claimed
Status
Done
Problem
9
Open Since
2024-10-11 0:00
Deadline
2024-10-26 23:59
Extension
24 hour(s)