Submission #1131167

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<cassert>
#define PB push_back
#define MP make_pair
#define sz(v) (in((v).size()))
#define forn(i,n) for(in i=0;i<(n);++i)
#define forv(i,v) forn(i,sz(v))
#define fors(i,s) for(auto i=(s).begin();i!=(s).end();++i)
#define all(v) (v).begin(),(v).end()
using namespace std;
typedef long long in;
typedef vector<in> VI;
typedef vector<VI> VVI;
const in mdl=1000000007;
int main(){
  ios::sync_with_stdio(0);
  cin.tie(0);
  in w=1;
  in n;
  cin>>n;
  in x;
  in inq=0;
  forn(z,n){
    cin>>x;
    if(x<=inq*2){
      w=w*(inq+1)%mdl;
      continue;
    }
    ++inq;
  }
  while(inq>=1){
    w=w*inq%mdl;
    --inq;
  }
  cout<<w<<endl;
  return 0;
}

Submission Info

Judge Result