465B - Inbox (100500) - CodeForces Solution


implementation *1000

Please click on ads to support us..

Python Code:

input()
a=input()+' '
print(a.count('1')+max(len([*filter(None,a.split('0 '))])-1,0))

C++ Code:

#include <bits/stdc++.h>
#define deb(x) cout<<endl<<#x <<" = "<<x<<endl<<endl
using namespace std;
typedef long long ll;
typedef double dd;

int main()
{
    ll tt; tt=1;
    while(tt--)
    {
        ll n; cin>>n;
        ll a[n];
        for(ll i=0;i<n;i++) cin>>a[i];

        for(ll i=1;i<n-1;i++) if(a[i-1]==1 && a[i+1]==1) a[i]=1;

        ll ans=0,buff=0;

        for(ll i=0;i<n;i++){
            if(a[i]){
                buff++;
            }
            else if(buff){
                ans+=buff;
                ans++;
                buff=0;
            }
        }
        if(buff){
            ans+=buff;
            ans++;
        }
        cout<<max(0ll,--ans)<<endl;
    }
}


Comments

Submit
0 Comments
More Questions

41C - Email address
1373D - Maximum Sum on Even Positions
1574C - Slay the Dragon
621A - Wet Shark and Odd and Even
1395A - Boboniu Likes to Color Balls
1637C - Andrew and Stones
1334B - Middle Class
260C - Balls and Boxes
1554A - Cherry
11B - Jumping Jack
716A - Crazy Computer
644A - Parliament of Berland
1657C - Bracket Sequence Deletion
1657B - XY Sequence
1009A - Game Shopping
1657A - Integer Moves
230B - T-primes
630A - Again Twenty Five
1234D - Distinct Characters Queries
1183A - Nearest Interesting Number
1009E - Intercity Travelling
1637B - MEX and Array
224A - Parallelepiped
964A - Splits
1615A - Closing The Gap
4C - Registration System
1321A - Contest for Robots
1451A - Subtract or Divide
1B - Spreadsheet
1177A - Digits Sequence (Easy Edition)