D - Game

You are playing a very popular computer game. The next level consists of nn consecutive locations, numbered from 11 to nn, each of them containing either land or water. It is known that the first and last locations contain land, and for completing the level you have to move from the first location to the last. Also, if you become inside a location with water, you will die, so you can only move between locations with land.

You can jump between adjacent locations for free, as well as no more than once jump from any location with land ii to any location with land i + xi+x, spending xx coins (x \geq 0x≥0).

Your task is to spend the minimum possible number of coins to move from the first location to the last one.

Note that this is always possible since both the first and last locations are the land locations.

Input

There are several test cases in the input data. The first line contains a single integer tt (1 \leq t \leq 1001≤t≤100) — the number of test cases. This is followed by the test cases description.

The first line of each test case contains one integer nn (2 \leq n \leq 1002≤n≤100) — the number of locations.

The second line of the test case contains a sequence of integers a_1, a_2, \ldots, a_na1​,a2​,…,an​ (0 \leq a_i \leq 10≤ai​≤1), where a_i = 1ai​=1 means that the ii-th location is the location with land, and a_i = 0ai​=0 means that the ii-th location is the location with water. It is guaranteed that a_1 = 1a1​=1 and a_n = 1an​=1.

Output

For each test case print a single integer — the answer to the problem.

Sample 1

Inputcopy	Outputcopy
3 2 1 1 5 1 0 1 0 1 4 1 0 1 1	0 4 2

 

有 nn 个连续的位置，标号为 11 到 nn，每个位置是陆地或者水，已知第一个和最后一个位置都是陆地。你需要从第一个位置移动到最后一个位置，并且只能在是陆地的位置之间移动。
你可以免费地在连续的位置间移动，并且可以最多做一次这样的移动：花费 xx 块钱从位置 ii 移动到位置 i+x（x\ge0）i+x（x≥0）
你的任务是花费最少的钱从第一个位置移动到最后一个位置。
请注意这永远是可行的，因为第一个和最后一个位置是都陆地。

Input

输入中有若干组测试数据。
第一行包含一个整数 tt，代表数据组数。
每组数据第一行有一个整数n(1\le n \le 100)n(1≤n≤100)，代表位置的个数。
第二行包含一个由整数组成的数列a_1,a_2,…,a_n (0\le ai\le1)a1​,a2​,…,an​(0≤ai≤1), 其中a_i=1ai​=1代表第ii个位置是陆地，a_i=0ai​=0 表示第ii个位置是水，保证a_1=1a1​=1且a_n=1an​=1。

Output

对每组测试数据输出一个整数——问题的答案。

因为整个过程只能跳转一次，所以要找到第一个水坑前一个陆地的标号，和最后一个水坑后一个陆地的标号。再将标号相减即可求出花费的钱数。

#include<bits/stdc++.h>
using namespace std;
int a[110];
int main()
{
    int t,n,i1,i2;
    cin>>t;
    while(t--)
    {
        int flag=0;
        cin>>n;
        for(int i=0; i<n; i++)
        {
            cin>>a[i];
        }
        for(int i=0; i<n; i++)
        {
            if(a[i]==0)
            {
                flag=1;
                break;
            }
        }
        if(flag==0)
        {
        	cout<<"0"<<endl;
		}
        else if(flag==1)
        {
            for(int i=0; i<n; i++)
            {
                if(a[i]==0)
                {
                    i1=i-1;
                    break;
                }
            }
            for(int i=n-1; i>=0; i--)
            {
                if(a[i]==0)
                {
                    i2=i+1;
                    break;
                }
            }
            cout<<i2-i1<<endl;
        }
    }
}