Solution S o l u t i o n
一个显然的想法就是去找最小的那个数。
最小的数的
l
l
和 就应该是
1
1
和 。
因为这是一个排列,我们把问题从最小值处
pos
p
o
s
分开,得到两个一样的问题
(1,pos−1)
(
1
,
p
o
s
−
1
)
和
(pos+1,n)
(
p
o
s
+
1
,
n
)
。设区间长度为
len
l
e
n
,分出的两个区间长度为
lenl,lenr
l
e
n
l
,
l
e
n
r
,贡献就是这两个问题的答案的积乘上
(len−1lenl)
(
l
e
n
−
1
l
e
n
l
)
。
找最小值可以暴力用
map
map
存下来就好啦~
O(nlogn)
O
(
n
log
n
)
。
题解的说法是这是个笛卡尔树。。吧
#include <bits/stdc++.h>
#define show(x) cerr << #x << " = " << x << endl
using namespace std;
typedef long long ll;
typedef pair<int, int> pairs;
const int N = 1010101;
const int MOD = 1000000007;
inline char get(void) {
static char buf[100000], *S = buf, *T = buf;
if (S == T) {
T = (S = buf) + fread(buf, 1, 100000, stdin);
if (S == T) return EOF;
}
return *S++;
}
template<typename T>
inline int read(T &x) {
static char c; x = 0; int sgn = 0;
for (c = get(); c < '0' || c > '9'; c = get()) {
if (c == '-') sgn = 1;
if (c == EOF) return 0;
}
for (; c >= '0' && c <= '9'; c = get()) x = x * 10 + c - '0';
if (sgn) x = -x; return 1;
}
int n, test;
int l[N], r[N];
int fac[N], ifac[N];
map<int, int> mp[N];
inline void pre(int n) {
ifac[1] = 1;
for (int i = 2; i <= n; i++)
ifac[i] = (ll)(MOD - MOD / i) * ifac[MOD % i] % MOD;
fac[0] = ifac[0] = 1;
for (int i = 1; i <= n; i++) {
fac[i] = (ll)fac[i - 1] * i % MOD;
ifac[i] = (ll)ifac[i - 1] * ifac[i] % MOD;
}
}
inline int C(int n, int m) {
return (ll)fac[n] * ifac[m] % MOD * ifac[n - m] % MOD;
}
inline int solve(int dl, int dr) {
if (dl > dr) return 1;
int pos = mp[dl][dr];
if (dl == dr && pos == dl) return 1;
if (pos < dl || pos > dr) return 0;
int res = (ll)C(dr - dl, pos - dl) * solve(dl, pos - 1) % MOD * solve(pos + 1, dr) % MOD;
return res;
}
int main(void) {
freopen("1.in", "r", stdin);
freopen("1.out", "w", stdout);
pre(1000000);
while (read(n)) {
++test;
for (int i = 1; i <= n; i++) read(l[i]);
for (int i = 1; i <= n; i++) read(r[i]);
int f = 1;
for (int i = 1; i <= n; i++) {
if (mp[l[i]].count(r[i])) f = 0;
mp[l[i]][r[i]] = i;
}
if (f) printf("Case #%d: %d\n", test, solve(1, n));
else printf("Case #%d: 0\n", test);
for (int i = 1; i <= n; i++) mp[i].clear();
}
return 0;
}