coderforce 586A Alena's Schedule

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
const int maxm=1e2+10;
int a[maxm];
int main()
{
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        a[0]=0;
        a[n+1]=0;
        int cnt=0;
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&a[i]);
        }
        for(int i=1;i<=n;i++)
        {
            if((a[i-1]&&a[i+1])||(a[i]))
            {
                cnt++;
            }
        }
        printf("%d\n",cnt);
    }
    return 0;
}

你可能感兴趣的:(coderforce 586A Alena's Schedule)