zoj3772 Calculate the Function(矩阵+线段树)

题目链接
题意 ：给出一个函数
在区间[L,R]
F(L) = a[L];
F(L+1) = a[L+1]
F(k) = F(k-1)+F(k-2)*a[k] {L+2<=k<=R}
解法：转换为矩阵
1 a[k] f(x-1)
a 0 乘以 f(x-2)

#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define cl(a,b) memset(a,b,sizeof(a))
#define pb push_back

const int maxn = 500015;
const int inf  = 1<<28;
const LL mod = 1000000007;

LL a[maxn];
struct Matrix{
    LL a[2][2];
};
Matrix p[maxn];
Matrix mul(Matrix a, Matrix b){
    Matrix t;
    cl(t.a,0);
    for(int i=0;i<2;i++){
        for(int j=0;j<2;j++){
            for(int k=0;k<2;k++){
                t.a[i][j]=(t.a[i][j]+a.a[i][k]*b.a[k][j]%mod)%mod;
                t.a[i][j]%=mod;
            }
        }
    }
    return t;
}

void Set(int rt,LL v){
    cl(p[rt].a,0);
    p[rt].a[0][0]=p[rt].a[1][0]=1;
    p[rt].a[0][1]=v%mod;
}

void push_up(int rt){
    p[rt]=mul(p[rt*2+2],p[rt*2+1]);
}
void build(int rt,int l,int r){
    if(l==r){
        LL x;scanf("%lld",&x);
        a[l]=x;
        Set(rt,x);
        return ;
    }
    int mid=l+r>>1;
    build(rt*2+1,l,mid);
    build(rt*2+2,mid+1,r);
    push_up(rt);
}

Matrix query(int rt,int l,int r,int x,int y){
    if(x<=l&&r<=y){
        return p[rt];
    }
    int mid=l+r>>1;
    Matrix ans;//初始化为单位的矩阵
    ans.a[0][0]=1;ans.a[0][1]=0;ans.a[1][0]=0;ans.a[1][1]=1;
    if(x<=mid)ans=mul(ans,query(rt*2+1,l,mid,x,y));
    if(y>mid)ans=mul(query(rt*2+2,mid+1,r,x,y),ans);
    return ans;
}

int main(){
    int T;scanf("%d",&T);
    while(T--){
        int n,m;scanf("%d%d",&n,&m);
        build(0,0,n-1);
        while(m--){
            int x,y;
            scanf("%d%d",&x,&y);x--;y--;
            if(y-x<2){
                printf("%lld\n",x==y?a[x]%mod:a[x+1]%mod);continue;
            }
            Matrix xx =  query(0,0,n-1,x+2,y);
            LL ans=(xx.a[0][0]*a[x+1]+xx.a[0][1]*a[x])%mod;
            printf("%lld\n",ans);
        }
    }
    return 0;
}