矩阵基础1009 CodeForces 392C 好题,超级推荐

题意:
F[1]=1,F[2]=2,F[n]=F[n-1]+F[n-2]
A[i]=F[i]*i^k
思路:
(n+1)^k=sigma(C(k,i)*n^i)|0<=i<=k(牛顿二项式
F[n+1]*n^k=F[n]*n^k+F[n-1]*n^k
=sigma(F[n]*C(k,i)*n^i)|(0<=i<=k)+sigma(F[n-1]*C(k,i)*n^i)|(0<=i<=k)
因为里边C(k,i)是已知量,我们就可进行转化
=sigma(u(n,i)*C(k,i))+sigma(v(n,i)*C(k,i))
->F[n+1]可以由u(n,i)&v(n,i)推出来
u(n+1,k)=(n+1)^k*F[n+1]=sigma(F[n]*C(k,i)*n^i)+sigma(F[n-1]*C(k,i)*n^i)
=sigma(u(n,i)*C(k,i))+sigma(v(n,i)*C(k,i))
->u(n+1,k)可以由u(n,i)&v(n,i)推出来
v(n+1,k)=(n+1)^k*F[n]=sigma(F[n]*(n^i)*C(k,i))=sigma(u(n,i)*C(k,i))
->v(n+1,k)可以由u(n,i)推出来
Sum[i]=Sum[i-1]+u(n,i)
另:
A*F(i)=F(i+1)|F(i)同样代表一个矩阵
题目总是需要我们求都在F(i)内的元素相乘
我们需要把都在矩阵里的东西转化成
F(i)=u0(i-1)*t0+u1(i-1)*t1+u2(i-1)*t2
ui(n)可以由ui(n-1)或uj(n-1)推出来就行了
ti必须是已知的
感觉还是不太清晰…再做几道题感受感受

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#include<math.h>
#include<queue>
#include<stack>
#include<string>
#include<vector>
#include<map>
#include<set>
using namespace std;
#define lowbit(x) (x&(-x))
typedef long long LL;
const int maxn = 100005;
const int inf=(1<<28)-1;
#define Matrix_Size 105
const LL MOD = 1e9+7;
int Size;
struct Matrix
{
    LL mat[Matrix_Size][Matrix_Size];
    void clear()
    {
        memset(mat,0,sizeof(mat));
    }
    void output()
    {
        for(int i = 0;i < Size;i++)
        {
            for(int j = 0;j < Size;j++)
                printf("%d ",mat[i][j]);
            printf("\n");
        }
    }
    Matrix operator *(const Matrix &b)const
    {
        Matrix ret;
        for(int i = 0;i < Size;i++)
            for(int j = 0;j < Size;j++)
            {
                ret.mat[i][j] = 0;
                for(int k = 0;k < Size;k++)
                {
                    long long tmp = (long long)mat[i][k]*b.mat[k][j]%MOD;
                    ret.mat[i][j] = (ret.mat[i][j]+tmp);
                    if(ret.mat[i][j]>=MOD)
                        ret.mat[i][j] -= MOD;
                    if(ret.mat[i][j]<0)//注意是否需要MOD 
                        ret.mat[i][j] += MOD;
                }
            }
        return ret;
    }
};
Matrix pow_M(Matrix a,long long n)
{
    Matrix ret;
    ret.clear();
    for(int i = 0;i < Size;i++)
        ret.mat[i][i] = 1;
    Matrix tmp = a;
    while(n)
    {
        if(n&1)ret = ret*tmp;
        tmp = tmp*tmp;
        n>>=1;
    }
    return ret;
}
LL C[45][45]; 
void init()
{
    C[0][0]=1;
    for(int i=1;i<45;++i)
    {
        C[i][0]=1;
        C[i][1]=i;
        for(int j=2;j<=i;++j)
            C[i][j]=C[i-1][j-1]+C[i-1][j];
    }
}
int main()
{
    init();
    /*for(int i=1;i<45;++i)
    {
        for(int j=1;j<=i;++j)
            printf("%lld ",C[i][j]);
        printf("\n");
    }
    printf("\n");
    */
    LL n,k;
    scanf("%lld%lld",&n,&k);
    if(n==1)
    {
        printf("1\n");
        return 0;
    }
    Size=2*k+3;
    Matrix A,B;
    A.clear();B.clear();
    A.mat[0][0]=1;
    for(int i=0;i<=k;++i)
        A.mat[0][i+2+k]=A.mat[0][i+1]=C[k][i];
    for(int i=0;i<=k;++i)
    {
        for(int j=0;j<=i;++j)
        {
            A.mat[i+1][j+1]=A.mat[i+1][j+2+k]=C[i][j];
            A.mat[i+2+k][j+1]=C[i][j];
        }
    }
    //A.output();printf("\n");
    for(int i=0;i<Size;++i)
        B.mat[i][0]=1;
    A=pow_M(A,n-1);
    A=A*B;
    printf("%lld\n",A.mat[0][0]);
    return 0;
}