A11278 | $Yet Yet Another Permutation Problem$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

You are given a permutation $p$ of length $n$ . Please count the number of permutations $q$ of length $n$ which satisfy the following: - for each $1 \le i < n$ , $\max(q_1,\ldots,q_i) \neq \max(p_1,\ldots,p_i)$ . Since the answer may be large, output the answer modulo $998\,244\,353$ .

Each test contains multiple test cases. The first line contains the number of test cases $t$ ( $1 \le t \le 10^4$ ). The description of the test cases follows. The first line of each test case contains a single integer $n$ ( $2 \le n \le 2 \cdot 10^5$ ). The second line of each test case contains $n$ integers $p_1, p_2, \ldots, p_n$ ( $1 \le p_i \le n$ ). It is guaranteed that $p$ is a permutation. It is guaranteed that the sum of $n$ over all test cases does not exceed $2 \cdot 10^5$ .

For each test case, print a single integer — the answer modulo $998\,244\,353$ .

输入 #1

6
2
2 1
3
1 2 3
3
3 1 2
4
2 4 1 3
5
3 5 1 4 2
15
6 13 2 8 7 11 1 3 9 15 4 5 12 10 14

输出 #1

C++ 编辑器

输入

输出