Educational Codeforces Round 113 (Rated for Div. 2)_C. Jury Meeting

Educational Codeforces Round 113 (Rated for Div. 2)

终于补完了两场。
祝我们的好队友涛涛妹妹生日快乐！

C. Jury Meeting

题目传送门：

题目传送门

题目大意：

一堆数字让你排序，问有几种排序方式，满足依次-1后，不会产生连续两次都是同一个元素-1的情况。

思路

代码：

#include <bits/stdc++.h>

using namespace std;
const int maxn = 2e5 + 5;
const int mod = 998244353;
typedef long long ll;
ll a[maxn], f[maxn], inv[maxn];

ll qpow(ll x, ll n) {
    ll ans = 1ll;
    while (n) {
        if (n & 1) ans = ans * x % mod;
        x = x * x % mod;
        n >>= 1;
    }
    return ans;
}

bool cmp(ll x, ll y) {
    return x > y;
}

int main() {
    f[0] = inv[0] = 1;
    for (int i = 1; i < maxn - 1; i++) f[i] = f[i - 1] * i % mod;
    for (int i = 1; i < maxn - 1; i++) inv[i] = qpow(f[i], mod - 2);
    //表示i的阶乘的逆元
    int T;
    cin >> T;
    while (T--) {
        int n;
        cin >> n;
        for (int i = 1; i <= n; i++) cin >> a[i];
        sort(a + 1, a + 1 + n, cmp);
        ll ma1 = 0, ma2 = 0;
        ll t = 0;

        for (int i = 1; i <= n; i++) {
            if (a[i] == a[1]) ma1++;
            else if (a[i] == a[1] - 1) ma2++;
            else break;
        }
        for (int i = 1; i <= n; i++) {
            if (a[i] != a[1]) {
                t = a[i];
                break;
            }
        }
        if (ma1 == 1 && a[1] - t >= 2) {
            cout << 0 << endl;
            continue;
        }
        //若最大值和次大值差超过2则无解

        ll  left = n - ma1 - ma2;
        ll  ans = 0;
        if (ma1 == 1) {
            for (int i = 0; i <= left; i++) {
                ll c = 1;
                c = c * f[left] * inv[i] % mod * inv[left - i] % mod;
                //C（i,left）
                c = c * f[ma2 + i - 1] % mod * inv[ma2 - 1] % mod;
                //这就是 (ma2+i-1)!/(ma2-1)!
                c = c * (ma2 + i) % mod;
                c = c * f[left - i] % mod;
                ans = (ans + c) % mod;
            }
            ans = ans * f[ma2] % mod;
        } else ans = f[n];
        cout << ans << endl;
    }
    return 0;
}