51Nod 1341 混合序列(矩阵快速幂)

思路：把f(n)展开有
$f\left(n\right)=a_0{b}_n+a_1{b}_{n-1}+a_2{b}_{n-2}+\cdots +a_n{b}_0$

再写出n-1

$f\left(n-1\right)=a_0{b}_{n-1}+a_1{b}_{n-2}+a_2{b}_{n-3}+\cdots +a_{n-1}{b}_0$

我们让f(n-1)*q得到

$f\left(n-1\right)q=a_0{b}_n+a_1{b}_{n-1}+a_2{b}_{n-2}+\cdots +a_{n-1}{b}_1$

发现与f(n)项相差了$a_n{b}_0$所以有

$f\left(n\right)=f\left(n-1\right)q+a_n{b}_0$

$a_n=a_{n-1}p+r$所以有

$f\left(n\right)=f\left(n-1\right)q+a_{n-1}p{b}_0+r{b}_0$

得到递推公式我们就可以写出矩阵了

有
$\left(\begin{array}{c}f(n)\\ a_n\\ r\end{array}\right)=\left(\begin{array}{ccc}q& p{b}_0& b_0\\ 0& p& 1\\ 0& 0& 1\end{array}\right)\left(\begin{array}{c}f(n-1)\\ a_{n-1}\\ r\end{array}\right)$
递推就是
$\left(\begin{array}{c}f(n)\\ a_n\\ r\end{array}\right)={\left(\begin{array}{ccc}q& p{b}_0& b_0\\ 0& p& 1\\ 0& 0& 1\end{array}\right)}^{n-1}\left(\begin{array}{c}f(1)\\ a_1\\ r\end{array}\right)$

#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAX 3
#define mod 1000000007
using namespace std;
typedef struct {
long long m[MAX][MAX];
}Matrix;
Matrix P={0};
Matrix I={1,0,0,0,1,0,0,0,1};
Matrix Matrixmul(Matrix a,Matrix b)
{
    int i,j,k;
    Matrix c;
    for(i=0;i<MAX;i++)
        for(j=0;j<MAX;j++)
        {
            c.m[i][j]=0;
            for(k=0;k<MAX;k++)
            {
                c.m[i][j]+=(a.m[i][k]*b.m[k][j])%mod;
            }
            c.m[i][j]%=mod;
        }
        return c;
}
Matrix quickpow(long long n)
{
    Matrix m=P,b=I;
    while(n>0)
    {
        if(n%2==1)
            b=Matrixmul(b,m);
        n=n/2;
        m=Matrixmul(m,m);
    }
    return b;
}
int main()
{
    long long p,q,r,n;
    while(scanf("%lld%lld%lld%lld",&p,&q,&r,&n)!=EOF)
    {
        P.m[0][0]=q;
        P.m[0][1]=3*p;
        P.m[0][2]=3;
        P.m[1][1]=p;
        P.m[1][2]=1;
        P.m[2][2]=1;
        Matrix a;
        a=quickpow(n-1);
        printf("%lld\n",(a.m[0][0]*3*r%mod+(a.m[0][1]+a.m[0][2])*r%mod)%mod);
    }
    return 0;
}