牛客网 ~ 2018年湘潭大学程序设计竞赛G ~ 又见斐波那契 （矩阵快速幂）

题意

思路

显然就是矩阵快速幂，我们只需要构造6*6的矩阵使得
$F[i-1]+f[i-2]+i^3+i^2+i+1$ 乘一次可以转移到$F[i]+f[i-1]+(i+1{)}^3+(i+1{)}^2+(i+1)+1$
可以造出加速矩阵如下：
1 1 1 1 1 1
1 0 0 0 0 0
0 0 1 3 3 1
0 0 0 1 2 1
0 0 0 0 1 1
0 0 0 0 0 1

#include<bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
typedef long long LL;
struct Matrix
{
    int r, c;
    LL m[10][10];
    Matrix () {};
    Matrix (int r, int c)
    {
        this->r = r; this->c = c;
        memset(m, 0, sizeof(m));
    }

    Matrix operator + (Matrix b) const // a和b均为r * c的矩阵
    {
        Matrix ans(r, c);
        for (int i = 0; i < r; i++)
        {
            for (int j = 0; j < c; j++)
            {
                ans.m[i][j] = (m[i][j] + b.m[i][j]) % MOD;
            }
        }
        return ans;
    }

    Matrix operator * (Matrix b) const // 要求a.c == b.r
    {
        Matrix ans(r, b.c);
        for (int i = 0; i < ans.r; i++)
        {
            for (int j = 0; j < ans.c; j++)
            {
                for (int k = 0; k < c; k++)
                {
                    ans.m[i][j] += m[i][k] * b.m[k][j] % MOD;
                    ans.m[i][j] %= MOD;
                }
            }
        }
        return ans;
    }

};
Matrix qpow (Matrix a, LL b) // a必须是方阵(即r==c)
{
    Matrix res(a.r, a.r);
    for (int i = 0; i < res.r; i++) res.m[i][i] = 1; //初始化为单位方阵
    while (b)
    {
        if (b & 1) res = res * a;
        a = a * a;
        b >>= 1;
    }
    return res;
}

int main()
{
    int T; scanf("%d", &T);
    while (T--)
    {
        LL n; scanf("%lld", &n);
        Matrix B(6, 6), A(6, 1);

        B.m[0][0] = 1; B.m[0][1] = 1; B.m[0][2] = 1; B.m[0][3] = 1; B.m[0][4] = 1; B.m[0][5] = 1;
        B.m[1][0] = 1; B.m[1][1] = 0; B.m[1][2] = 0; B.m[1][3] = 0; B.m[1][4] = 0; B.m[1][5] = 0;
        B.m[2][0] = 0; B.m[2][1] = 0; B.m[2][2] = 1; B.m[2][3] = 3; B.m[2][4] = 3; B.m[2][5] = 1;
        B.m[3][0] = 0; B.m[3][1] = 0; B.m[3][2] = 0; B.m[3][3] = 1; B.m[3][4] = 2; B.m[3][5] = 1;
        B.m[4][0] = 0; B.m[4][1] = 0; B.m[4][2] = 0; B.m[4][3] = 0; B.m[4][4] = 1; B.m[4][5] = 1;
        B.m[5][0] = 0; B.m[5][1] = 0; B.m[5][2] = 0; B.m[5][3] = 0; B.m[5][4] = 0; B.m[5][5] = 1;

        A.m[0][0] = 1; A.m[1][0] = 0; A.m[2][0] = 8; A.m[3][0] = 4; A.m[4][0] = 2; A.m[5][0] = 1;

        A = qpow(B, n - 1) * A;
        printf("%lld\n", A.m[0][0]);
    }
    return 0;
}
/*
4
1
2
3
100
*/