【HDU6172】Array Challenge（BM算法）（线性递推）

传送门

---

猜想有线性递推式，然后直接用BM算法切掉了。

---

代码：

#include<bits/stdc++.h>
#define ll long long 
#define re register
#define cs const

cs int mod=1e9+7;
inline int add(int a,int b){return (a+=b)>=mod?a-mod:a;}
inline int dec(int a,int b){return (a-=b)<0?a+mod:a;}
inline int mul(int a,int b){static ll r;r=(ll)a*b;return r>=mod?r%mod:r;}
inline int power(int a,int b,int res=1){
	for(;b;b>>=1,a=mul(a,a))(b&1)&&(res=mul(res,a));
	return res;
}
inline void Inc(int &a,int b){(a+=b)>=mod&&(a-=mod);}
inline void Dec(int &a,int b){(a-=b)<0&&(a+=mod);}
inline void Mul(int &a,int b){a=mul(a,b);}

typedef std::vector<int> Poly;

Poly Mod;

inline Poly operator+(cs Poly &a,cs Poly &b){
	Poly c=a;if(b.size()>a.size())c.resize(b.size());
	for(int re i=0;i<b.size();++i)Inc(c[i],b[i]);
	return c;
}

inline Poly operator*(cs Poly &a,cs Poly &b){
	if(!a.size()||!b.size())return Poly(0,0);
	int n=a.size(),m=b.size();
	Poly c(n+m-1,0);
	for(int re i=0;i<n;++i)
	for(int re j=0;j<m;++j)
	Inc(c[i+j],mul(a[i],b[j]));
	return c;
}

inline void poly_mod(Poly &a){
	int d=Mod.size()-1;
	for(int re i=a.size()-1;i>=d;--i)if(a[i])
	for(int re j=1;j<=d;++j)Inc(a[i-j],mul(a[i],Mod[j]));
	a.resize(d);
}

namespace BM{
	cs int M=100;
	int L,cnt,a[M],fail[M],delta[M];
	Poly R[M];
	Poly solve(){
		for(int re i=1;i<=L;++i){
			int d=a[i];
			for(int re j=1,lj=R[cnt].size();j<lj;++j)Dec(d,mul(R[cnt][j],a[i-j]));
			if(!d)continue;
			fail[cnt]=i,delta[cnt]=d;
			if(!cnt){R[++cnt].resize(i+1);}
			else {
				int coef=mul(delta[cnt],power(delta[cnt-1],mod-2));
				R[cnt+1].resize(i-fail[cnt-1]);R[cnt+1].push_back(coef);
				for(int re j=1,lj=R[cnt-1].size();j<lj;++j)R[cnt+1].push_back(mul(mod-coef,R[cnt-1][j]));
				R[cnt+1]=R[cnt+1]+R[cnt];++cnt;
			}
		}
		return R[cnt];
	}
	ll b[M],h[M];
	inline void init(){
		L=9;
		h[0]=2,h[1]=3,h[2]=6;
		for(int re i=3;i<=L+2;++i)h[i]=4*h[i-1]+17*h[i-2]-12*h[i-3]-16;
		for(int re i=1;i<=L+1;++i)b[i]=3*h[i+1]*h[i]+9*h[i+1]*h[i-1]+9*h[i]*h[i]+27*h[i]*h[i-1]-18*h[i+1]-126*h[i]-81*h[i-1]+192;
		for(int i=1;i<=L;++i)a[i]=sqrt(b[i+1]+(1ll<<((i+1)*2)));
	}
}

signed main(){
#ifdef zxyoi
	freopen("array.in","r",stdin);
#endif
	BM::init();Mod=BM::solve();
	int T;scanf("%d",&T);
	while(T--){
		ll n;scanf("%lld",&n);
		Poly f(1,1),g(2,1);g[0]=0;
		for(n-=2;n;n>>=1,g=g*g,poly_mod(g))
		if(n&1)f=f*g,poly_mod(f);
		int ans=0;
		for(int re i=0;i<f.size();++i)Inc(ans,mul(BM::a[i+1],f[i]));
		std::cout<<ans<<"\n";
	}
	return 0;
}