Submission #69304634

---

Source Code Expand

  //#include "atcoder/modint"
  #pragma GCC optimize("Ofast")
  #include "atcoder/all"
  #include <bits/stdc++.h>
  #include  <string>
  using namespace std;
  using namespace atcoder;
  #define int long long
    template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
  template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
  //const int MOD =1e9+7;
  //constexpr int MOD =10;
  constexpr int MOD =998244353;
  const long long M1=167772161,M2=469762049,M3=1224736769;
  //const int MOD =31607;
  using mint = static_modint<MOD>;
  //using mint = double;
  //using mint = modint;
  ostream& operator << (ostream& ost, const mint& m){ost << m.val();return ost;}
  istream& operator >> (istream& ost,  mint& m){int a;ost >> a;m=a;return ost;}
  double time_limit = 100.0,start_temp=0.01,end_temp=0.0;
  int n=500, m=50, l=998000000000000ll, u=1002000000000000ll,a[500],b[50];
  int s=2000000000ll,a_s[500],sc=MOD*MOD; 
  std::mt19937 rng(std::random_device{}()); 

  signed main(){
    //ios_base::sync_with_stdio(false);
    //cin.tie(NULL);
    int n;
    cin>>n;
    int l[n];
    for(int i=0;i<n;i++)cin>>l[i];
    int a=0,b=n;
    while(l[a]==0&&a<n)a++;
    while(l[b-1]==0&&b>0)b--;
    if(a>=b){
        cout<<0<<endl;
        return 0;
    }
    cout<<b-a-1<<endl;
    
    

  
 
   

  }

Submission Info

Judge Result