HDU 6030 Happy Necklace[找规律][矩阵快速幂]

题意：问一个长度为n，由R和B构成字符串，在每个斐波那契长度的子串中，R的个数不少于B。

分析：直接搞不知道怎么搞，然后就手动打了打表，，打到了8，找了一个多小时= =。

最后发现规律是 a[n] = a[n - 1] + a[n - 3];

因为n有1e18，所以还需要矩阵快速幂加个速。

以下是代码：

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<queue>
#include<map>
#include<set>
#include<stack>
#include<cstring>
#include<string>
#include<vector>
#include<iomanip>
//#include<unordered_set>
//#include<unordered_map>
#include<cmath>
#include<list>
#include<bitset>
using namespace std;
#define _____ ios::sync_with_stdio(false); cin.tie(0);
#define ull unsigned long long
#define ll long long
#define lson l,mid,id<<1
#define rson mid+1,r,id<<1|1

typedef pair<int, int>pii;
typedef pair<ll, ll>pll;
typedef pair<double, double>pdd;
const double eps = 1e-6;
const int MAXN = 3;
const int MAXM = 5005;
const ll LINF = 0x3f3f3f3f3f3f3f3f;
const int INF = 0x3f3f3f3f;
const double FINF = 1e18;
const ll MOD = 1000000007;


#define ll long long
struct Mat {
    ll Edge[MAXN][MAXN];
    Mat friend operator* (Mat &a, Mat &b) {
        Mat c;
        memset(c.Edge, 0, sizeof(c.Edge));
        for (int i = 0; i<MAXN; ++i) {
            for (int j = 0; j<MAXN; ++j) {
                for (int k = 0; k<MAXN; ++k) {
                    c.Edge[i][j] += a.Edge[i][k] * b.Edge[k][j];
                    c.Edge[i][j] %= MOD;
                }
            }
        }
        return c;
    }
    Mat friend operator+(Mat &a, Mat &b) {
        Mat res;
        for (int i = 0; i<MAXN; ++i) {
            for (int j = 0; j<MAXN; ++j) {
                res.Edge[i][j] = a.Edge[i][j] + b.Edge[i][j];
                res.Edge[i][j] %= MOD;
            }
        }
        return res;
    }
}tmp, E;
Mat qpow(ll n)
{
    Mat ans = E, uu = tmp;
    while (n)
    {
        if (n & 1)ans = ans * uu;
        uu = uu * uu;
        n >>= 1;
    }
    return ans;
}
int main()
{
    int t;
    ll n;
    memset(tmp.Edge, 0, sizeof(tmp.Edge));
    tmp.Edge[0][0] = tmp.Edge[0][1] = tmp.Edge[1][2] = 1;
    tmp.Edge[2][0] = 1;
    scanf("%d", &t);
    while (t--)
    {
        memset(E.Edge, 0, sizeof(E.Edge));
        E.Edge[0][0] = 6, E.Edge[0][1] = 4, E.Edge[0][2] = 3;
        scanf("%I64d", &n);
        if (n == 2)printf("3\n");
        else if (n == 3)printf("4\n");
        else if (n == 4)printf("6\n");
        else
        {
            Mat ans = qpow(n - 4);
            printf("%I64d\n", ans.Edge[0][0]);
        }
    }
}