【Disturbed People】【CodeForces - 1077B】（思维水题）

题目：

There is a house with nn flats situated on the main street of Berlatov. Vova is watching this house every night. The house can be represented as an array of nninteger numbers a1,a2,…,ana1,a2,…,an, where ai=1ai=1 if in the ii-th flat the light is on and ai=0ai=0 otherwise.

Vova thinks that people in the ii-th flats are disturbed and cannot sleep if and only if 1<i<n1<i<n and ai−1=ai+1=1ai−1=ai+1=1 and ai=0ai=0.

Vova is concerned by the following question: what is the minimum number kk such that if people from exactly kk pairwise distinct flats will turn off the lights then nobody will be disturbed? Your task is to find this number kk.

Input

The first line of the input contains one integer nn (3≤n≤1003≤n≤100) — the number of flats in the house.

The second line of the input contains nn integers a1,a2,…,ana1,a2,…,an (ai∈{0,1}ai∈{0,1}), where aiaiis the state of light in the ii-th flat.

Output

Print only one integer — the minimum number kk such that if people from exactly kkpairwise distinct flats will turn off the light then nobody will be disturbed.

Examples

Input

10
1 1 0 1 1 0 1 0 1 0

Output

Input

5
1 1 0 0 0

Output

Input

4
1 1 1 1

Output

Note

In the first example people from flats 22 and 77 or 44 and 77 can turn off the light and nobody will be disturbed. It can be shown that there is no better answer in this example.

There are no disturbed people in second and third examples.

解题报告：数据出水了，所以直接暴力就可以ac 。如果一个不开灯的人两边都是开灯的话，他无法正常入眠，问至少关闭需要关闭多少灯才可以！

ac代码：

#include<bits/stdc++.h>
using namespace std;int num[155];
int main()
{int n;int cnt=0;scanf("%d",&n);for(int i=0;i<n;i++)scanf("%d",&num[i]);for(int i=1;i<n-1;i++){if(num[i-1]==1&&num[i]==0&&num[i+1]==1){cnt++;num[i+1]=0;}}printf("%d\n",cnt);
}

【Disturbed People】【CodeForces - 1077B】（思维水题）相关推荐

codeforces 1060a（思维水题）
Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", ...
FZU 2230 2230 翻翻棋（思维水题）
Problem Description 象棋翻翻棋(暗棋)中双方在4*8的格子中交战,有时候最后会只剩下帅和将.根据暗棋的规则,棋子只能上下左右移动,且相同的级别下,主动移动到地方棋子方将吃掉对方的棋 ...
B - Average Numbers CodeForces - 134A（水题，思维）
You are given a sequence of positive integers a1, a2, -, an. Find all such indices i, that the i-th ...
CF Round #426 (Div. 2) The Useless Toy 思维水题
题目链接: http://codeforces.com/contest/834/problem/A 题目描述: 输入起始状态和结束状态和数列长度, 判断旋转方向是顺时针逆时针还是不合理解题思路: 长 ...
Codeforces数据结构（水题）小结
最近在使用codeblock,所以就先刷一些水题上上手使用codeblock遇到的问题 1.无法进行编译-------从setting中的编译器设置中配置编译器 2.建立cpp后无法调试------ ...
A - System Administrator CodeForces - 245A（水题）
Polycarpus is a system administrator. There are two servers under his strict guidance - a and b. To ...
Letters CodeForces - 978C（水题，low_bound()函数使用）
水题,记录一下low_bound(*begin,*end,num),其中low-bound是指以num为下界,寻找第一个比num大或相等的元素的指针,通过减去*begin指针我们可以获得相应的下标. ...
【CodeForces - 707B】Bakery（思维水题）
Bakery Descriptions 玛莎想在从1到n的n个城市中开一家自己的面包店,在其中一个城市烘焙松饼. 为了在她的面包房烘焙松饼,玛莎需要从一些储存的地方建立面粉供应.只有k个仓库,位于不同 ...
CodeForces - 622C Not Equal on a Segment(思维+水题)
题目链接:点击查看题目大意:先给出一个长度为n的数列,然后给出m次询问,每次询问的格式是l,r,x,其中[l,r]代表的是数列的下标范围,要求我们输出任意一个在区间[l,r]内值不等于x的下标题目 ...

【Disturbed People】【CodeForces - 1077B】（思维水题）

【Disturbed People】【CodeForces - 1077B】（思维水题）相关推荐

最新文章

热门文章