Codeforces Round #325 (Div. 2) A. Alena's Schedule 水题

A. Alena's Schedule

Time Limit: 1 Sec  

Memory Limit: 256 MB

题目连接

http://codeforces.com/contest/586/problem/A

Description

Alena has successfully passed the entrance exams to the university and is now looking forward to start studying.

One two-hour lesson at the Russian university is traditionally called a pair, it lasts for two academic hours (an academic hour is equal to 45 minutes).

The University works in such a way that every day it holds exactly n lessons. Depending on the schedule of a particular group of students, on a given day, some pairs may actually contain classes, but some may be empty (such pairs are called breaks).

The official website of the university has already published the schedule for tomorrow for Alena's group. Thus, for each of the n pairs she knows if there will be a class at that time or not.

Alena's House is far from the university, so if there are breaks, she doesn't always go home. Alena has time to go home only if the break consists of at least two free pairs in a row, otherwise she waits for the next pair at the university.

Of course, Alena does not want to be sleepy during pairs, so she will sleep as long as possible, and will only come to the first pair that is presented in her schedule. Similarly, if there are no more pairs, then Alena immediately goes home.

Alena appreciates the time spent at home, so she always goes home when it is possible, and returns to the university only at the beginning of the next pair. Help Alena determine for how many pairs she will stay at the university. Note that during some pairs Alena may be at the university waiting for the upcoming pair.

Input

The first line of the input contains a positive integer n (1 ≤ n ≤ 100) — the number of lessons at the university.

The second line contains n numbers a_i (0 ≤ a_i ≤ 1). Number a_i equals 0, if Alena doesn't have the i-th pairs, otherwise it is equal to 1. Numbers a₁, a₂, ..., a_n are separated by spaces.

​i​​,C​i​​，即此题的初始分值、每分钟减少的分值、dxy做这道题需要花费的时间。

Output

Print a single number — the number of pairs during which Alena stays at the university.

Sample Input

5
0 1 0 1 1

Sample Output

4

HINT

题意

有人要去上课，1代表有课，0代表没课

这个人在有两个及以上连续的没课的时候，才会回家

然后问你这个人得在学校呆多久

题解：

直接暴力扫一遍就好了

有课会呆在学校，没课但是，上下都是课的，也会呆在学校

代码：

#include<stdio.h>
#include<iostream>
#include<math.h>
#include<iostream>
using namespace std;

int a[505];
int main()
{
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
        scanf("%d",&a[i]);
    int ans = 0;
    for(int i=1;i<=n;i++)
    {
        if(a[i]==1)
            ans++;
        if(a[i]==0&&a[i-1]==1&&a[i+1]==1)
            ans++;
    }
    cout<<ans<<endl;
}