Mortal Kombat Tower

							***C. Mortal Kombat Tower***

You and your friend are playing the game Mortal Kombat XI. You are trying to pass a challenge tower. There are n bosses in this tower, numbered from 1 to n. The type of the i-th b## oss is ai. If the i-th boss is easy then its type is ai=0, otherwise this boss is hard and its type is ai=1.

During one session, either you or your friend can kill one or two bosses (neither you nor your friend can skip the session, so the minimum number of bosses killed during one session is at least one). After your friend session, your session begins, then again your friend session begins, your session begins, and so on. The first session is your friend’s session.

Your friend needs to get good because he can’t actually kill hard bosses. To kill them, he uses skip points. One skip point can be used to kill one hard boss.

Your task is to find the minimum number of skip points your friend needs to use so you and your friend kill all n bosses in the given order.

For example: suppose n=8, a=[1,0,1,1,0,1,1,1]. Then the best course of action is the following:

your friend kills two first bosses, using one skip point for the first boss;
you kill the third and the fourth bosses;
your friend kills the fifth boss;
you kill the sixth and the seventh bosses;
your friend kills the last boss, using one skip point, so the tower is completed using two skip points.
You have to answer t independent test cases.

Input
The first line of the input contains one integer t (1≤t≤2⋅104) — the number of test cases. Then t test cases follow.

The first line of the test case contains one integer n (1≤n≤2⋅105) — the number of bosses. The second line of the test case contains n integers a1,a2,…,an (0≤ai≤1), where ai is the type of the i-th boss.

It is guaranteed that the sum of n does not exceed 2⋅105 (∑n≤2⋅105).

Output
For each test case, print the answer: the minimum number of skip points your friend needs to use so you and your friend kill all n bosses in the given order.

Example
inputCopy
6
8
1 0 1 1 0 1 1 1
5
1 1 1 1 0
7
1 1 1 1 0 0 1
6
1 1 1 1 1 1
1
1
1
0
outputCopy
2
2
2
2
1
0
一道经典的dp问题。我们要找准状态，由于每一关都是层层递进的，且每一关的通关者可以是你或者你朋友。（第一关除外。）那么我们则可以用01变量来表示你朋友和你。则我们就可以找到状态了：

用dp[i][0]表示通第i 关需要使用的最少通关卡，且第i关为你朋友通关。
用dp[ i ][1]表示通关第i关需要使用的最少通关卡，且第i关为你通关。
找准状态之后根据题意设立状态转移方程即可（一定是根据题意来建立的），OK，具体看代码。

#include"cstdio"
#include"cstring"
#include"algorithm"
#include"cmath"
#include"iostream" 
using namespace std;
#define inf 0x3f3f3f3f
int dp[200005][2],a[200005];
int main()
{
	int t;
	cin>>t;
	while(t--)
	{
		int n;
		cin>>n;
		for(int i = 1; i <= n; i ++)
		{
			cin>>a[i];
		}
		memset(dp,inf,sizeof(dp));
		dp[1][0] = a[1];
		dp[2][0] = dp[1][0] + a[2];
		dp[2][1] = dp[1][0];
		for(int i = 3; i <= n;i ++)
		{
			dp[i][0] = min(dp[i - 1][1] + a[i],dp[i-2][1] + a[i-1] + a[i]);
			dp[i][1] = min(dp[i-1][0],dp[i-2][0]);
		}
		cout<<min(dp[n][0],dp[n][1])<<endl;
	}
	return 0;
}