ZOJ 3772 Calculate the Function(线段树)

给出一个序列，并且给出一特递推式，有n次查询每次查询输出递推式的结果。

我们将递推式化简为矩阵，在线段树的节点里存矩阵，每次查询区间的矩阵的乘

#include <iostream>
#include <cstdio>
#include <set>
#include <string>
#include <string.h>
#include <cstring>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <algorithm>
#include <sstream>
#include<cstdlib>
#define mt(a) memset(a,0,sizeof a)
#define fl(a,b,c) fill(a,b,c)
#define pii pair<int,int>
#define INF 1000000000+7
#define MAXN 100005
#define mod 1000000007
#define iin(x) scanf("%d",&x)
#define complete_unique(x) x.erase(unique(x.begin(),x.end()),x.end())
using namespace std;
typedef long long ll;
#define sp system("pause")

struct node
{
	int l,r;
	ll jz[2][2];
}M[MAXN << 2],us;

ll a[MAXN];

node  mulM(node  &x, node & y,int l,int r)
{
	node temp;
	temp.l = l,temp.r = r;
	for (int i = 0; i <=1; i++)
	{
		for (int j = 0; j <= 1; j++)
		{
			temp.jz[i][j] = 0;
			for (int k = 0; k <= 1; k++)
			{
				temp.jz[i][j] = (temp.jz[i][j] + x.jz[i][k] * y.jz[k][j] % mod) % mod;
			}
		}
	}
	return temp;
}

void push_up(int ind)
{
	M[ind] = mulM(M[ind << 1],M[ind << 1 | 1],M[ind].l,M[ind].r);
}

void build(int ind,int l,int r)
{
	//cout << ind << endl;
	//cout << l << " " << r << endl;
	M[ind].l = l,M[ind].r = r;
	if(l == r)
	{
		M[ind].jz[0][0] = 1,M[ind].jz[0][1] = 1;
		M[ind].jz[1][0] = a[l],M[ind].jz[1][1] = 0;
  	}
	else
	{
		build(ind << 1,l,(l + r) >> 1);
		build(ind << 1 | 1,((l + r) >> 1) + 1,r);
		push_up(ind);
	}
}

void query(int ind ,int l,int r)
{
	//cout << M[ind].l << "??????" << M[ind].r << endl;
	//cout << us.jz[0][0] << "~!!!!!!" << us.jz[0][1] << endl;
	cout << us.jz[1][0] << "^^^^^^" << us.jz[1][1] << endl;
	if(M[ind].r < l || M[ind].l > r)
		return;
	if(M[ind].l >= l && M[ind].r <= r)
		us = mulM(us,M[ind],0,0);
	else
	{
		query(ind << 1,l,r);
		query(ind << 1 | 1,l,r);
	}
}

int main()
{
	int t;
	cin >> t;
	while(t--)
	{
		int n,m;
		cin >> n >> m;
		for(int i = 1;i <= n;i++)
		{
			scanf("%lld",&a[i]);
		}
		build(1,1,n);
		for(int i = 0;i < m;i++)
		{
			memset(us.jz,0,sizeof(us.jz));
			int x,y;
			iin(x),iin(y);
			if(y - x <= 1)
			{
				printf("%lld\n",a[y]);
			}
			else
			{
				us.jz[0][0] = 1,us.jz[1][1] = 1;
				query(1,x+2,y);
				node fk;
				memset(fk.jz,0,sizeof(fk.jz));
				fk.jz[0][0] = a[x + 1];fk.jz[0][1] = a[x];
				fk = mulM(fk,us,0,0);
				printf("%lld\n",fk.jz[0][0]);
			}
		}
	}
}