HDU - 5863 cjj's string game 矩阵快速幂优化DP

传送门：HDU5863

题意：有k种不同的字符，每种字符有无限个，要求用这k种字符构造两个长度为n的字符串a和b，使得a串和b串的最长公共子串长度恰为m，问方案数 

思路：完全来自：点击打开链接

dp[i][j] := 构造出长度为i的子串并且最后j个字符匹配的方案数。

dp[i][j] = dp[i-1][j-1]*k.

dp[i][0] = ∑(dp[i-1][j]*(k-1)*k) (0=<j<=m).

dp[0][0] = 1.

dp[0][i] = 0.

矩阵快速幂加速递推式。

代码：

#include<bits/stdc++.h>
#define ll long long
#define inf 0x3f3f3f3f
using namespace std;
typedef pair<int,int> P;
const int MAXN = 100010;
const int mod = 1e9 + 7;
struct mat{
	ll val[12][12];
	int sz;
	friend mat operator * (const mat & A, const mat & B)
	{
		mat C = {0}; C.sz = A.sz;
		for(int k = 1; k <= C.sz; k++)
		for(int i = 1; i <= C.sz; i++)
		{
			if(A.val[i][k] == 0) continue;
			for(int j = 1; j <= C.sz; j++)
			C.val[i][j] = (C.val[i][j] + A.val[i][k] * B.val[k][j]) % mod;
		}
		return C;
	}
};
mat mat_qmul(mat A, int n)//快速幂求A^n 
{
	mat B = {0}; B.sz = A.sz;
	for(int i = 1; i <= B.sz; i++) B.val[i][i] = 1;
	while(n)
	{
		if(n & 1) B = B * A;
		n >>= 1;
		A = A * A;
	}
	return B;
}
ll solve(int n, int m, int k)
{
	mat A = {0}; A.sz = m + 1;
	for(int i = 1; i <= A.sz; i++) A.val[1][i] = k * (k - 1);
	for(int i = 2; i <= A.sz; i++) A.val[i][i - 1] = k;
	A = mat_qmul(A, n);
	ll sum = 0;
	for(int i = 1; i <= A.sz; i++)
	sum = (sum + A.val[i][1]) % mod;
	return sum;
}
int main()
{
	int T, n, m, k;
	cin >> T;
	while(T--)
	{
		scanf("%d %d %d", &n, &m, &k);
		printf("%lld\n", (solve(n, m, k) - solve(n, m - 1, k) + mod) % mod);
	}
 	return 0;
}