题目详情题解（0）讨论（0）提交记录（0）

CF1923A.Moving Chips

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

The first line contains one integer tt ( 1≤t≤10001 \le t \le 1000 ) — the number of test cases.

Each test case consists of two lines:

  • the first line contains one integer nn ( 2≤n≤502 \le n \le 50 ) — the number of cells;
  • the second line contains nn integers a1,a2,…,ana_1, a_2, \dots, a_n ( 0≤ai≤10 \le a_i \le 1 ); ai=0a_i = 0 means that the ii -th cell is free; ai=1a_i = 1 means that the ii -th cell contains a chip.

Additional constraint on the input: in each test case, at least one cell contains a chip.

输入格式

For each test case, print one integer — the minimum number of operations you have to perform so that all chips form a single block without any free cells between them.

输出格式

In the first example, you can perform the operation on the chip in the 77 -th cell. The closest free cell to the left is the 55 -th cell, so it moves there. After that, all chips form a single block.

In the second example, all chips are already in a single block. Same for the third example.

输入输出样例

  • 输入#1

    5
8
0 1 1 1 0 1 1 0
6
0 1 0 0 0 0
6
1 1 1 1 1 1
5
1 0 1 0 1
9
0 1 1 0 0 0 1 1 0

    输出#1

    1
0
0
2
3

说明/提示

In the first example, you can perform the operation on the chip in the 77 -th cell. The closest free cell to the left is the 55 -th cell, so it moves there. After that, all chips form a single block.

In the second example, all chips are already in a single block. Same for the third example.

首页