【题解】LuoGu6858：深海少女与胖头鱼

原题传送门
期望dp
$d{p}_{n,m}=1+\frac{n}{n+m}d{p}_{n+m-1,1}+\frac{m}{n+m}d{p}_{n,m-1}$
然后发现无法实现

经过部分分$m=0$启发
又看见了$n<=10^{14},m<=10^6$
猜想时间复杂度可能只与$m$有关

$d{p}_{n,1}=1+\frac{n}{n+1}d{p}_{n,1}+\frac{1}{n+1}d{p}_{n,0}$
$-->d{p}_{n,1}=(n+1)+d{p}_{n,0}(1式)$
$d{p}_{n,0}=1+d{p}_{n-1,1}(2式)$

将1式代到2式里面，得到$d{p}_{n,0}=(n+1)+d{p}_{n-1,0}$
将2式代到1式里面，得到$d{p}_{n,1}=(n+2)+d{p}_{n-1,1}$
这样我把$d{p}_{n,0},d{p}_{n,1}$的通项都求出来了
然后求通项
$d{p}_{n,0}=2+3+...+(n+1)=\frac{n(n+3)}{2}=\frac{n^3+3n}{2}$
$d{p}_{n,1}=2+3+...+(n+2)-1=\frac{(n+1)(n+4)}{2}-1=\frac{n^2+5n+2}{2}$

这样一开始那么转移可以写成
$d{p}_{n,m}=\frac{n}{n+m}\frac{(n+m-1{)}^2+5(n+m-1)+2}{2}+\frac{m}{n+m}d{p}_{n,m-1}+1$
可以把第一维弄掉
变成$d{p}_i=\frac{n}{n+i}\frac{(n+i-1{)}^2+5(n+i-1)+2}{2}+\frac{n}{n+i}d{p}_{i-1}+1$
复杂度$O(m)$

Code：

#include <bits/stdc++.h>
#define LL long long
using namespace std;
const LL qy = 998244353;
LL n, m;

inline LL read(){
	LL s = 0, w = 1;
	char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') w = -1;
	for (; isdigit(c); c = getchar()) s = (s << 1) + (s << 3) + (c ^ 48);
	return s * w;
}

LL ksm(LL n, LL k){
	LL s = 1;
	for (; k; k >>= 1, n = n * n % qy) if (k & 1) s = s * n % qy;
	return s;
}

int main(){
	n = read() % qy, m = read();
	LL inv2 = ksm(2, qy - 2);
	LL ans = n % qy * (n + 3) % qy * inv2 % qy;
	for (LL i = 1; i <= m; ++i){
		ans = ans * i % qy * ksm((i + n) % qy, qy - 2) % qy;
		ans = (ans + 1) % qy;
		ans = (ans + n * ksm((n + i) % qy, qy - 2) % qy * inv2 % qy * ((i + n - 1) % qy * ((i + n - 1) % qy) % qy + 5LL * (i + n - 1) % qy + 2LL) % qy) % qy;
	}
	printf("%lld\n", ans);
	return 0;
}