Submission #69301389

---

Source Code Expand

//# pragma GCC target("avx2")
# pragma GCC optimize("O3")
# pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#include"atcoder/all"
using namespace atcoder;
typedef modint998244353 mi;
using namespace std;
#define all(a) a.begin(),a.end()
template<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}
template<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}
#define compress(a) sort(all(a));a.erase(unique(all(a)),a.end())
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P,ll> PP;
constexpr ll mod=1000000007;
constexpr ll inf=3e18;

int main(){
	int n;
	cin>>n;
	vector<ll>l(n);
	rep(i,n)cin>>l[i];
	int L=-1,R=-1;
	rep(i,n){
		if(l[i]==1){
			L=i;
			break;
		}
	}
	for(int i=n-1;i>=0;i--){
		if(l[i]==1){
			R=i;
			break;
		}
	}
	if(L==-1)cout<<0<<endl;
	else if(L==R)cout<<0<<endl;
	else cout<<R-L<<endl;
}

Submission Info

Judge Result