15250번 - Palindromic Partitions 서브태스크다국어

A partition of a string s is a set of one or more non-overlapping non-empty substrings of s (call them a₁, a₂, a₃, . . . , a_d), such that s is their concatenation: s = a₁ +a₂ +a₃ +. . .+a_d. We call these substrings "chunks" and define the length of such a partition to be the number of chunks, d.

We can represent the partition of a string by writing each chunk in parentheses. For example, the string "decode" can be partitioned as (d)(ec)(ode) or (d)(e)(c)(od)(e) or (decod)(e) or (decode) or (de)(code) or a number of other ways.

A partition is palindromic if its chunks form a palindrome when we consider each chunk as an atomic unit. For example, the only palindromic partitions of "decode" are (de)(co)(de) and (decode). This also illustrates that every word has a trivial palindromic partition of length one.

Your task is to compute the maximal possible number of chunks in palindromic partition.

The input starts with the number of test cases t in the first line. The following t lines describe individual test cases consisting of a single word s, containing only lowercase letters of the English alphabet. There are no spaces in the input.

For every testcase output a single number: the length of the longest palindromic partition of the input word s.

Let us denote the length of the input string s with n.

• 1 ≤ t ≤ 10
• 1 ≤ n ≤ 10⁶