Codeforces Round #521 (Div. 3) B. Disturbed People

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 nn integer 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 aiai is the state of light in the ii -th flat.

Output

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

Examples

Input

Copy

10
1 1 0 1 1 0 1 0 1 0

Output

Copy

Input

Copy

5
1 1 0 0 0

Output

Copy

Input

Copy

4
1 1 1 1

Output

Copy

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.

思路：倒序直接根据条件判断即可，满足就ans++,将左边的1变成0

AC代码：

#include<cstdio>
using namespace std;
int a[108];
int main()
{int n;scanf("%d",&n);for(int i=1;i<=n;i++){scanf("%d",&a[i]);}int ans=0;for(int i=n-1;i>1;i--){if(a[i-1]==a[i+1]&&a[i-1]==1&&a[i]==0){a[i-1]=0;ans++;}}printf("%d\n",ans);return 0;
}

Codeforces Round #521 (Div. 3) B. Disturbed People相关推荐

CodeForces Round #521 (Div.3) B. Disturbed People
http://codeforces.com/contest/1077/problem/B There is a house with nn flats situated on the main str ...
Codeforces Round #521 (Div. 3) B - Disturbed People （贪心）
题目链接:http://codeforces.com/contest/1077/problem/B 题意:给你一长度为n的01序列.0表示当前位置的房子灯是灭的,1表示当前房子的位置灯是亮的.判断某个 ...
Codeforces Round #521 (Div. 3) B. Disturbed People 思维
题解题目大意 n个灯0关灯1开灯 101则中间的睡不着问最少关掉多少个灯可以全都能睡着遇见101则将后面的1的灯泡关掉这样解决10101的问题计数输出即可 AC代码 #include < ...
B. Disturbed People（模拟） Codeforces Round #521 (Div. 3)
原题链接: https://codeforces.com/contest/1077/problem/B 样例: Examples Input 10 1 1 0 1 1 0 1 0 1 0 Output ...
Codeforces Round #521 (Div. 3)
题目链接:http://codeforces.com/contest/1077 A.Frog Jumping 解题思路:作差再判断最后是否还要向右跳一次即可. AC代码: 1 #include< ...
Codeforces Round #521 (Div.3)题解
A过水,不讲题解 CF1077B [Disturbed People] 这题就是个显而易见的贪心可是我考场上差点没想出来显然把一户被打扰的人家的右边人家的灯关掉肯定比把左边的灯关掉从左到右扫一遍 ...
Codeforces Round #521 (Div. 3): F. Pictures with Kittens（DP+单调队列）
题意: 你有n幅画,第i幅画的好看程度为ai,再给你两个数字k,x,表示你要从中选出刚好x幅画,并且相邻两幅画的距离不能≥k,好看程度之和最大能多少,选不出来输出-1,F1数据范围<200,F2 ...
Codeforces Round #506 (Div. 3)
Codeforces Round #506 (Div. 3) 实习期间事不多,对div3 面向题解和数据编程了一波 A. Many Equal Substrings 题目链接 A题就是找后缀和前缀重合 ...
Codeforces Round #563 (Div. 2)/CF1174
Codeforces Round #563 (Div. 2)/CF1174 CF1174A Ehab Fails to Be Thanos 其实就是要\(\sum\limits_{i=1}^n a_i ...

Codeforces Round #521 (Div. 3) B. Disturbed People

Codeforces Round #521 (Div. 3) B. Disturbed People相关推荐

最新文章

热门文章