ROCK - Sweet and Sour Rock
A manufacturer of sweets has started production of a new type of sweet called rock. Rock comes in sticks composed of one-centimetre-long segments, some of which are sweet, and the rest are sour. Before sale, the rock is broken up into smaller pieces by splitting it at the connections of some segments.
Today's children are very particular about what they eat, and they will only buy a piece of rock if it contains more sweet segments than sour ones. Try to determine the total length of rock which can be sold after breaking up the rock in the best possible way.
The input begins with the integer t, the number of test cases. Then t test cases follow.
For each test case, the first line of input contains one integer N - the length of the stick in centimetres (1<=N<=200). The next line is a sequence of N characters '0' or '1', describing the segments of the stick from the left end to the right end ('0' denotes a sour segment, '1' - a sweet one).
For each test case output a line with a single integer: the total length of rock that can be sold after breaking up the rock in the best possible way.
Sample input: 2 15 100110001010001 16 0010111101100000 Sample output: 9 13
i guess the output for the first test case in the example is wrong , it should be 5 its no way 9
i think the question is very unclear. can anyone elaborate on the test cases or what exactly is the "best possible way".
@amit and santosh: make use of the forum. This is for comments about the problem, not requests for test cases.