Submission #1163003

---

Source Code Expand

#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
const int inf = 1e9;
const int mod = 1e9+7;

int N, A;
ll pro[2010], inv[2010];
ll powMod(int a, int n, int m){
  ll pro = 1, tmp = a;
  for(; n > 0; n >>= 1){
    if(n & 1) pro = (pro * tmp) % m;
    tmp = tmp * tmp % m;
  }
  return pro;
}
ll divide(int n, int a){
  ll ret = 1;
  FOR(i, 1, a + 1){
    ret = ret * (n + i) % mod;
    ret = ret * powMod(i, mod - 2, mod) % mod;
  }
  return ret;
}
main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  ll ans = 1;
  int s, count;
  s = 0;
  count = 0;
  cin >> N;
  FOR(i, 0, N){
    cin >> A;
    if(A < 0){
      count++;
    }else{
      ans = ans * divide(A - s, count) % mod;
      s = A;
      count = 0;
    }
  }
  cout << ans << endl;
}

Submission Info

Judge Result