传送门
题意
给出排列P,两个人轮流取数,每次取的数需要在之前该人取数的右边,且比当前取出来所有的数都要大。所有当前可选的数都将等概率随机的被当前决策人选中。问两个人期望取数的轮数。
分析
我们用 f [ i ] [ j ] f[i][j] f[i][j]表示上一个人取 i i i,当前这个人取 a [ j ] a[j] a[j]的情况,假设一开始选的是 0 0 0,那么最后的答案就是 ∑ 1 = 1 n f [ 0 ] [ i ] \sum_{1=1}^nf[0][i] ∑1=1nf[0][i]
代码
#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 5e3 + 10;
const int mod = 998244353;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
int a[N];
ll inv[N];
ll f[N][N];
ll n;
ll ksm(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1) res = res * a % mod;
b >>= 1;
a = a * a % mod;
}
return res;
}
int main() {
read(n);
for (int i = 1; i <= n; i++) read(a[i]), inv[i] = ksm(i, mod - 2);
for (int i = n; i; i--) {
int cnt = 0, res = 0;
for (int j = n; ~j; j--) {
if (a[j] > i) {
cnt++;
res = (res + f[i][a[j]]) % mod;
}
else if (a[j] < i) {
f[a[j]][i] = (res * inv[cnt] % mod + 1ll) % mod;
}
}
}
ll ans = 0;
for (ll i = 1; i <= n; i++) ans = (ans + f[0][i]) % mod;
dl(ans * inv[n] % mod);
return 0;
}
/**
* ┏┓ ┏┓+ +
* ┏┛┻━━━┛┻┓ + +
* ┃ ┃
* ┃ ━ ┃ ++ + + +
* ████━████+
* ◥██◤ ◥██◤ +
* ┃ ┻ ┃
* ┃ ┃ + +
* ┗━┓ ┏━┛
* ┃ ┃ + + + +Code is far away from
* ┃ ┃ + bug with the animal protecting
* ┃ ┗━━━┓ 神兽保佑,代码无bug
* ┃ ┣┓
* ┃ ┏┛
* ┗┓┓┏━┳┓┏┛ + + + +
* ┃┫┫ ┃┫┫
* ┗┻┛ ┗┻┛+ + + +
*/