Educational Codeforces Round 83 (Rated for Div. 2) D. Count the Arrays（组合数学）

传送门

题意：

Your task is to calculate the number of arrays such that:

each array contains 𝑛 elements;
each element is an integer from 1 to 𝑚;
for each array, there is exactly one pair of equal elements;
for each array 𝑎, there exists an index 𝑖 such that the array is strictly ascending before the 𝑖-th element and strictly descending after it (formally, it means that 𝑎𝑗<𝑎𝑗+1, if 𝑗<𝑖, and 𝑎𝑗>𝑎𝑗+1, if 𝑗≥𝑖).

思路：

从m个数中选取n-1个
最大的数的位置固定
两个相等的数可能有n-2种，位置也固定
剩下n-3个数,每个数有选左边或者右边两种情况，且选取之后位置也固定

所以答案是$C_m^{n-1}\ast (n-2)\ast 2^{n-3}$

组合数2e5，处理线性逆元就可以了，卢卡斯也行

代码：

#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <vector>
#include <math.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=a;i>=b;i--)
typedef long long ll;
using namespace std;
const int MAXN=2e5+50;
const int inf=0x3f3f3f3f;
const int M=5000*4;
const int mod=998244353;
ll fac[MAXN];
ll quick(ll a,ll b){//快速幂
    ll ans=1;
    while(b){
        if(b&1)ans=ans*a%mod;
        a=a*a%mod;
        b/=2;
    }
    return ans%mod;
}
ll ccc(ll n,ll m){//求组合数
	return (fac[n] * quick(fac[m], mod - 2) % mod * quick(fac[n - m], mod - 2) % mod)%mod;
}
int main()
{
    std::ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    fac[0] = 1;
        for (int i = 1; i <= 200000; i++){
            fac[i] = fac[i - 1] * i % mod;
        }
        //cout<<ccc(4,3)<<endl;
    int n,m;
    cin>>n>>m;
    if(n==2){
    	cout<<0<<endl;
    	return 0;
    }
    cout<<ccc(m,n-1)*quick(2,n-3)%mod*(n-2)%mod<<endl;
    return 0;
}
/*
42 1337
*/

summery

我真是个sb，一直读错题