Codeforces 1077B Disturbed People （模拟）

 

B. Disturbed People

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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

2

input

Copy

5
1 1 0 0 0

output

Copy

0

input

Copy

4
1 1 1 1

output

Copy

0

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.

 

 

这个题实际上，如果出现“101”的情况，就优先去除右边的1，因为左边的1肯定是不影响这个0的，不然你怎么遍历过来的呢？ 

#include<iostream>
#include<cstdio>
using namespace std;
typedef long long LL;

int main()
{   int a[2000];
    int n,m,j,k,i,T;
    cin>>n;

    for (i=1; i<=n; i++)
        cin>>a[i];

    int sum=0;
    for (i=2; i<=n-1; i++)
    {
        if (a[i]==0)
        {
            if (a[i-1]==1 && a[i+1]==1)
            {
                a[i+1]=0;
                sum++;
            }

        }
            /*for (i=1;i<=n;i++)
                cout<<a[i]<<" ";
            cout<<endl;*/

    }
    cout<<sum<<endl;
    return 0;
}

 

转载于:https://www.cnblogs.com/Romantic-Chopin/p/10253024.html