Kingdom of Black and White （分类讨论）

In the Kingdom of Black and White (KBW), there are two kinds of frogs: black frog and white frog.
Now N frogs are standing in a line, some of them are black, the others are white. The total
strength of those frogs are calculated by dividing the line into minimum parts, each part should still be
continuous, and can only contain one kind of frog. Then the strength is the sum of the squared length
for each part.
However, an old, evil witch comes, and tells the frogs that she will change the color of at most one
frog and thus the strength of those frogs might change.
The frogs wonder the maximum possible strength after the witch finishes her job.
Input
First line contains an integer T, which indicates the number of test cases.
Every test case only contains a string with length N, including only 0 (representing a black frog)
and 1 (representing a white frog).
Restrictions:
• 1 ≤ T ≤ 50.
• for 60% data, 1