Time Limit: 2000/1000 MS (Java/Others)

Memory Limit: 65536/65536 K (Java/Others)

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.

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

The frogs wonder the

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).

$\cdot$ $1 \leq T \leq 50$.

$\cdot$ for 60% data, $1 \leq N \leq 1000$.

$\cdot$ for 100% data, $1 \leq N \leq 10^5$.

$\cdot$ the string only contains 0 and 1.

Every test case only contains a string with length $N$, including only $0$ (representing

a black frog) and $1$ (representing a white frog).

$\cdot$ $1 \leq T \leq 50$.

$\cdot$ for 60% data, $1 \leq N \leq 1000$.

$\cdot$ for 100% data, $1 \leq N \leq 10^5$.

$\cdot$ the string only contains 0 and 1.

提交代码