Yet Another Bookshelf

题意翻译

数列上每次可以选择一段全为1的连续区间将其左移1或者右移1，询问使所有为1的位置在唯一一个连续区间的最小操作次数。T次询问，数据保证给定数列上至少有一个1。

题目描述

There is a bookshelf which can fit $ n $ books. The $ i $ -th position of bookshelf is $ a_i = 1 $ if there is a book on this position and $ a_i = 0 $ otherwise. It is guaranteed that there is at least one book on the bookshelf. In one move, you can choose some contiguous segment $ [l; r] $ consisting of books (i.e. for each $ i $ from $ l $ to $ r $ the condition $ a_i = 1 $ holds) and: - Shift it to the right by $ 1 $ : move the book at index $ i $ to $ i + 1 $ for all $ l \le i \le r $ . This move can be done only if $ r+1 \le n $ and there is no book at the position $ r+1 $ . - Shift it to the left by $ 1 $ : move the book at index $ i $ to $ i-1 $ for all $ l \le i \le r $ . This move can be done only if $ l-1 \ge 1 $ and there is no book at the position $ l-1 $ . Your task is to find the minimum number of moves required to collect all the books on the shelf as a contiguous (consecutive) segment (i.e. the segment without any gaps). For example, for $ a = [0, 0, 1, 0, 1] $ there is a gap between books ( $ a_4 = 0 $ when $ a_3 = 1 $ and $ a_5 = 1 $ ), for $ a = [1, 1, 0] $ there are no gaps between books and for $ a = [0, 0,0] $ there are also no gaps between books. You have to answer $ t $ independent test cases.

输入输出格式

输入格式

The first line of the input contains one integer $ t $ ( $ 1 \le t \le 200 $ ) — the number of test cases. Then $ t $ test cases follow. The first line of the test case contains one integer $ n $ ( $ 1 \le n \le 50 $ ) — the number of places on a bookshelf. The second line of the test case contains $ n $ integers $ a_1, a_2, \ldots, a_n $ ( $ 0 \le a_i \le 1 $ ), where $ a_i $ is $ 1 $ if there is a book at this position and $ 0 $ otherwise. It is guaranteed that there is at least one book on the bookshelf.

输出格式

For each test case, print one integer: the minimum number of moves required to collect all the books on the shelf as a contiguous (consecutive) segment (i.e. the segment without gaps).

输入输出样例

输入样例 #1

5
7
0 0 1 0 1 0 1
3
1 0 0
5
1 1 0 0 1
6
1 0 0 0 0 1
5
1 1 0 1 1

输出样例 #1

2
0
2
4
1

说明

In the first test case of the example, you can shift the segment $ [3; 3] $ to the right and the segment $ [4; 5] $ to the right. After all moves, the books form the contiguous segment $ [5; 7] $ . So the answer is $ 2 $ . In the second test case of the example, you have nothing to do, all the books on the bookshelf form the contiguous segment already. In the third test case of the example, you can shift the segment $ [5; 5] $ to the left and then the segment $ [4; 4] $ to the left again. After all moves, the books form the contiguous segment $ [1; 3] $ . So the answer is $ 2 $ . In the fourth test case of the example, you can shift the segment $ [1; 1] $ to the right, the segment $ [2; 2] $ to the right, the segment $ [6; 6] $ to the left and then the segment $ [5; 5] $ to the left. After all moves, the books form the contiguous segment $ [3; 4] $ . So the answer is $ 4 $ . In the fifth test case of the example, you can shift the segment $ [1; 2] $ to the right. After all moves, the books form the contiguous segment $ [2; 5] $ . So the answer is $ 1 $ .

题意翻译

数列上每次可以选择一段全为1的连续区间将其左移1或者右移1，询问使所有为1的位置在唯一一个连续区间的最小操作次数。T次询问，数据保证给定数列上至少有一个1。