CF446C：线段树+数论

CF446C

题解：这真是一道好题。参考了下面大佬的博客，总结很棒。

https://blog.csdn.net/icefox_zhx/article/details/79423177

废话不多说，上我自己写的代码。还是比较规范，好看懂的。

代码：

/*
公式
Σai = an+2 - a2
an+2 = Fn * a1 + Fn+1 * a2(n表示长度)
an = fn-2 * a1 + fn-1 * a2
*/
#include <bits/stdc++.h>
#define mod(x)  ((x)%MOD)
using namespace std;
typedef long long ll;
int const MOD = 1e9 + 9;
int const N = 3e5 + 10;
int n,m;
ll f[N],sum[N],a[N];
struct Node
{
	int l,r;
	ll f1,f2,sum;
	void updata(ll val1,ll val2,int len){
		f1 = mod(f1 + val1);
		f2 = mod(f2 + val2);
		sum = mod(sum + val1 * f[len] + val2 * f[len+1] - val2 + MOD);    //新加的不是f1,f2
	}
}node[N<<4];
void Init(){
	f[1] = f[2] = 1;
	for(int i=3;i<=n+1;i++)    //更新到n+1
		f[i] = mod(f[i-1] + f[i-2]);
}
void push_up(int id){
	node[id].sum = mod(node[id<<1].sum + node[id<<1|1].sum);
}
ll cal(ll f1,ll f2,int len){   //求an = fn-2 * a1 + fn-1 * a2
	if(len == 1)	return f1;
	if(len == 2)	return f2;
	return mod(f1*f[len-2]+f2*f[len-1]);
}
void push_down(int id){
	int f1 = node[id].f1,	f2 = node[id].f2;
	if(f1 == 0 && f2 == 0)	return;
	int l = node[id].l,	r = node[id].r;
	int mid = (l + r) >> 1;
	node[id<<1].updata(f1,f2,mid-l+1);
	node[id<<1|1].updata(cal(f1,f2,mid-l+2),cal(f1,f2,mid-l+3),r-mid);
	node[id].f1 = node[id].f2 = 0;
}
void build(int id,int l,int r){
	node[id].l = l,node[id].r = r;
	node[id].f1 = node[id].f2 = 0;
	if(l == r)	scanf("%lld",&node[id].sum);
	else{
		int mid = (l + r) >> 1;
		build(id<<1,l,mid);
		build(id<<1|1,mid+1,r);
		push_up(id);
	}
}
void updata(int id,int L,int R){
	int l = node[id].l,	r = node[id].r;
	if(L <= l && r <= R){
		node[id].updata(f[l-L+1],f[l-L+2],r-l+1);
	}else{
		push_down(id);
		int mid = (l + r) >> 1;
		if(L <= mid)	updata(id<<1,L,R);
		if(mid < R)		updata(id<<1|1,L,R);
		push_up(id);
	}
}
ll query(int id,int L,int R){
	int l = node[id].l,	r = node[id].r;
	if(L <= l && r <= R){
		return node[id].sum;
	}else{
		push_down(id);
		int mid = (l + r) >> 1;
		ll sum = 0;
		if(L <= mid)	sum = mod(sum + query(id<<1,L,R));
		if(mid < R)		sum = mod(sum + query(id<<1|1,L,R));
		return sum;
	}
}
int main(){
	scanf("%d%d",&n,&m);
	Init();
	build(1,1,n);
	for(int i=1;i<=m;i++){
		int k,l,r;
		scanf("%d%d%d",&k,&l,&r);
		if(k == 1)	updata(1,l,r);
		else	printf("%lld\n",query(1,l,r));    
	}														
}