305698: CF1077B. Disturbed People
Memory Limit:256 MB
Time Limit:1 S
Judge Style:Text Compare
Creator:
Submit:21
Solved:0
Description
Disturbed People
题意翻译
###### 题目描述 对于一个给定的长度为$n$的$01$序列$a_1,a_2,\cdots,a_n$ 如果存在$1<i<n$满足$a_{i-1}=a_{i+1}=1,a_i=0$,那么这个序列是不优美的 求最少需要将多少个$1$变为$0$使得原序列变为优美的序列 ###### 输入格式 第一行一个整数$n(3\leq n\leq100)$ 第二行$n$个整数$a_1,a_2,\cdots,a_n(a_i\in{0,1})$表示给定序列 ###### 输出格式 输出一个整数表示答案题目描述
There is a house with $ n $ flats situated on the main street of Berlatov. Vova is watching this house every night. The house can be represented as an array of $ n $ integer numbers $ a_1, a_2, \dots, a_n $ , where $ a_i = 1 $ if in the $ i $ -th flat the light is on and $ a_i = 0 $ otherwise. Vova thinks that people in the $ i $ -th flats are disturbed and cannot sleep if and only if $ 1 < i < n $ and $ a_{i - 1} = a_{i + 1} = 1 $ and $ a_i = 0 $ . Vova is concerned by the following question: what is the minimum number $ k $ such that if people from exactly $ k $ pairwise distinct flats will turn off the lights then nobody will be disturbed? Your task is to find this number $ k $ .输入输出格式
输入格式
The first line of the input contains one integer $ n $ ( $ 3 \le n \le 100 $ ) — the number of flats in the house. The second line of the input contains $ n $ integers $ a_1, a_2, \dots, a_n $ ( $ a_i \in \{0, 1\} $ ), where $ a_i $ is the state of light in the $ i $ -th flat.
输出格式
Print only one integer — the minimum number $ k $ such that if people from exactly $ k $ pairwise distinct flats will turn off the light then nobody will be disturbed.
输入输出样例
输入样例 #1
10
1 1 0 1 1 0 1 0 1 0
输出样例 #1
2
输入样例 #2
5
1 1 0 0 0
输出样例 #2
0
输入样例 #3
4
1 1 1 1
输出样例 #3
0