洛谷 P5367 【模板】康托展开

$Description$

求$1\sim N$的一个给定全排列在所有$1\sim N$全排列中的排名。结果对$998244353$取模

$Solution$

康托展开
令$a_i$为$s_{i+1}\sim s_n$中比$s_i$小的数的数量
那么$$ans=\sum _{i=1}^n{a}_i\times (n-i)!+1$$
因为$ans$由$0$算起所以要加一
因为$1\le n\le 1000000$ 暴力$O(n^2)$过不了
所以用树状数组维护已经用过的比$s_i$小的数即可
时间复杂度$O(nlogn)$

$code$

暴力

#include<cstdio>

#define int long long 

using namespace std;

const int mod = 998244353;

int n, ans;
int a[1000005], f[1000005];

void ktzk() {
	ans = 1;
	for (int i = 1; i <= n; ++i) {
		int sum = 0;
		for (int j = i + 1; j <= n; ++j)
			if (a[j] < a[i]) ++sum;
		(ans += f[n-i] * sum) %= mod;
	}
}

signed main() {
	scanf("%d", &n);
	for (int i = 1; i <= n; ++i)
		scanf("%d", &a[i]);
	f[0] = f[1] = 1;
	for (int i = 2; i <= n; ++i)
		f[i] = (f[i-1] * i) % mod;
	ktzk();
	printf("%d", ans);
}

$Acceptedcode$

#include<cstdio>

#define lowbit(x) (x & (-x))
#define int long long 

using namespace std;

const int N = 1e6 + 5, mod = 998244353;

int n, ans;
int b[N], f[N];

void add(int i, int x) {
	for (; i <= n; i += lowbit(i)) b[i] += x;
}

int get_sum(int i) {
	int res = 0;
	for (; i; i -= lowbit(i)) res += b[i];
	return res;
}

signed main() {
	scanf("%d", &n);
	f[0] = 1;
	for (int i = 1; i <= n; ++i)
		f[i] = (f[i-1] * i) % mod, add(i, 1); //1~n都没用过
	ans = 1;
	for (int x, i = 1; i <= n; ++i) {
		scanf("%d", &x);
		(ans += f[n-i] * get_sum(x - 1) % mod) %= mod;//比x小的数的个数和 即a[i]
		add(x, -1); //x用过了改为0
	}
	printf("%d", ans);
}