问题 21814 --Splits the string

21814: Splits the string

时间限制: 1 Sec  内存限制: 64 MB
提交: 21  解决: 8
[提交][状态][讨论版][数据上传:][下载FPS1元][添加到购物车][下载测试数据1元][20kb]

题目描述

Hrdv is interested in a string,especially the palindrome string.So he wants some palindrome string.

A sequence of characters is a palindrome if it is the same written forwards and backwards. For example, 'abeba' is a palindrome, but 'abcd' is not.

A partition of a sequence of characters is a list of one or more disjoint non-empty groups of consecutive characters whose concatenation yields the initial sequence. For example, ('race', 'car') is a partition of 'racecar' into two groups.

Given a sequence of characters, we can always create a partition of these characters such that each group in the partition is a palindrome! Given this observation it is natural to ask: what is the minimum number of groups needed for a given string such that every group is a palindrome?

For example:

'racecar' is already a palindrome, therefore it can be partitioned into one group.
'fastcar' does not contain any non-trivial palindromes, so it must be partitioned as ('f', 'a', 's', 't', 'c', 'a', 'r').
'aaadbccb' can be partitioned as ('aaa', 'd', 'bccb').
Input begins with the number n of test cases. Each test case consists of a single line of between 1 and 1000 lowercase letters, with no whitespace within.

输入

Each test case consists of a single line of between 1 and 1000 lowercase letters, with no whitespace within.

输出

For each test case, output a line containing the minimum number of groups required to partition the input into groups of palindromes.

样例输入

racecar
fastcar
aaadbccb

样例输出

1
7
3

提示

来源

[提交][状态]