Submission #1625558

---

Source Code Expand

#define  _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include<map>
#include <iomanip>
#include <time.h>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include <cassert>
#include<fstream>
#include <unordered_map>
#include <cstdlib>
using namespace std;
#define Ma_PI 3.141592653589793
#define eps 0.00000000000000000000000001
#define LONG_INF 10000000000000000
#define GOLD 1.61803398874989484820458
#define MAX_MOD 1000000007
#define REP(i,n) for(long long i = 0;i < n;++i)
#define seg_size 262144
long long memo[20000] = {};
long long gyaku(long long now) {
	if (memo[now]) return memo[now];
	long long hoge = MAX_MOD - 2;
	long long ans = 1;
	long long gekogeko = now;
	while (hoge != 0) {
		if (hoge % 2 == 1) {
			ans *= now;
			ans %= MAX_MOD;
		}
		now *= now;
		now %= MAX_MOD;
		hoge /= 2;
	}
	return memo[gekogeko] = ans;
}
long long combination(long long left, long long right) {
	long long geko = 1;
	for (int i = 0;i < right;++i) {
		geko *= (long long)(left - i);
		geko %= MAX_MOD;
		geko *= gyaku(i + 1);
		geko %= MAX_MOD;
	}
	return geko;
}
int main() {
	long long ans = 1;
	long long n;
	cin >> n;
	long long minnest = 0;
	int cnt = 0;
	for (int i = 0;i < n;++i) {
		long long hoge = 0;
		cin >> hoge;
		if (hoge == -1)cnt++;
		if (i != 0 && hoge != -1&&cnt != 0) {
			ans *= combination(hoge - minnest + cnt, cnt);
			ans %= MAX_MOD;
			cnt = 0;
		}
		if (hoge != -1) minnest = hoge;
	}
	cout << ans << endl;
	return 0;

}

Submission Info

Judge Result