HDU 6690 Rikka with Segment Tree（递归）

大佬博客
题意可以从上面的博客中看题解也完全可以

思路就是定义3个函数$F,G,H$
他们都是关于长度为$1到n$的线段树的某种答案的和。
然后思考一下线段树分成两个线段树的过程，就可以递归计算答案了。
所以这个题的算法就是递归普及减难度
对不起要熟练运用STL使用map，所以应该是提高减

#include<bits/stdc++.h>
#define mod 998244353
#define LL long long
using namespace std;

map<LL,int>f,g,h;
int inv6 = (mod+1)/6;

int solve(LL n){
	if(f.count(n)) return g[n];
	if(n<=1) return f[n] = g[n] = h[n] = n;
	if(n&1){
		LL u = n / 2  , v = n - n / 2;
		solve(u),solve(v);
		int fu = f[u] , fv = f[v] , hu = h[u] , hv = h[v] , gu = g[u] , gv = g[v];
		f[n] = (3ll * fu + fv + 1ll * (n%mod) * (n%mod + 1) / 2 - 1) % mod;
		h[n] = (6ll * hu + 2ll * hv + fu - fv + 1ll*(n%mod)*(n%mod+1)%mod*(2ll*n%mod+1)%mod*inv6%mod-1)%mod;
		g[n] = (3ll * gu + gv + 2ll * hu + fu + 1ll*(n%mod)*(n%mod+1)%mod*(n%mod+2)%mod*inv6%mod-1)%mod;
	}
	else{
		LL u = n / 2 , v = u - 1;
		solve(u),solve(v);
		int fu = f[u] , fv = f[v] , hu = h[u] , hv = h[v] , gu = g[u] , gv = g[v];
		f[n] = (3ll * fu + fv + 1ll * (n%mod) * (n%mod+1) / 2 - 1) % mod;
		h[n] = (6ll * hu + 2ll * hv - fu + fv + 1ll*(n%mod)*(n%mod+1)%mod*(2ll*n%mod+1)%mod*inv6%mod-1)%mod;
		g[n] = (3ll * gu + gv + hu + hv + fv + 1ll*(n%mod)*(n%mod+1)%mod*(n%mod+2)%mod*inv6%mod-1)%mod;
	}
	return g[n];
}

int main(){
	int T;
	for(scanf("%d",&T);T--;){
		LL a,b;
		scanf("%lld%lld",&a,&b);
		printf("%d\n",((solve(b) - solve(a-1)) % mod + mod) % mod);
	}
}