HDU 4902 双标记线段树

比赛时，多维护了一个 maxNum,想做优化，结果把自己的代码弄乱了。。= =改不出来。。

赛后去掉maxNum。。就。。擦。。

type1 操作优先级最搞

type2 每次操作前要全部压下去。。

//tpl
//ipqhjjybj_tpl.h
//header.h
#include <cstdio>
#include <cstdlib>
#include <map>
#include <set>
#include <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
#include <string>
#include <queue>

#define mp(x,y) make_pair(x,y)
#define pii pair<int,int>
#define pLL pair<long long ,long long>
#define repn(i,j,k) for(int i = j; i <= k;i++)

#define MAX(x,a)  x=((x)<(a))?(a):(x); 
#define MIN(x,a)  x=((x)>(a))?(a):(x); 

using namespace std;


const int INF = 0x3f3f3f3f;

const int N = 1e5+10;
int a[N],cov[N<<2],cnum[N<<2],gf[N<<2],gnum[N<<2];
int n,m;
int ql,qr,val;

int gcd(int a,int b){
	if(a==0)return b;
	if(b==0)return a;
	return gcd(b,a%b);
}
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1

void push_down(int l,int r,int rt){

	if(cov[rt]){
		if(l<r){
			cov[rt<<1] = cov[rt<<1|1] = cov[rt];
			cnum[rt<<1] = cnum[rt<<1|1] = cnum[rt];
			gf[rt] = gnum[rt] = cov[rt] = cnum[rt] = 0;
		}else{
			a[l] = cnum[rt];
			gnum[rt] = cnum[rt] = gf[rt] = cov[rt] = 0;
		}
	}
	if(gf[rt]){
		int mid = (l+r)>>1;

		if(l<r){
			push_down(l,mid,rt<<1);
			push_down(mid+1,r,rt<<1|1);
			gnum[rt<<1] = gnum[rt<<1|1] = gnum[rt];
			gf[rt<<1] = gf[rt<<1|1] = gf[rt];
			gnum[rt] = gf[rt] = 0;
		}else{
			if(a[l] > gnum[rt])
				a[l] = gcd(a[l],gnum[rt]);
			gnum[rt] = 0;
			gf[rt] = 0;
			cov[rt] = cnum[rt] = 0;
		}
	}
}
void build(int l,int r,int rt){
	cov[rt]= cnum[rt] = gf[rt] = gnum[rt] = 0;
	if(l==r){
		return;
	}
	int mid = (l+r)>>1;
	build(lson);
	build(rson);

}
void cover(int l,int r,int rt){
	push_down(l,r,rt);
	if(ql <= l && r <= qr){
		cov[rt] = 1;
		cnum[rt] = val;
		gf[rt] = gnum[rt] = 0;
		return;
	}
	int mid = (l+r)>>1;
	if(ql <= mid)cover(lson);
	if(mid < qr) cover(rson);

}
void update(int l,int r,int rt){
	push_down(l,r,rt);
	if(ql <= l && r <= qr){
		gf[rt] = 1;
		gnum[rt] = val;
		cov[rt] = cnum[rt] = 0;
		return;
	}
	int mid = (l+r)>>1;
	if(ql <= mid)update(lson);
	if(mid < qr)update(rson);

}
vector<int> ans;
void push_down_all(int l,int r,int rt){
	push_down(l,r,rt);
	if(l==r){
		ans.push_back(a[l]);
		return;
	}
	int mid = (l+r)>>1;
	push_down_all(lson);
	push_down_all(rson);
}

int main(){
	int t;
	scanf("%d",&t);
	while(t--){
		scanf("%d",&n);
		repn(i,1,n) scanf("%d",a+i);
		scanf("%d",&m);
		build(1,n,1);
		int ty;
		while(m--){
			scanf("%d %d %d %d",&ty,&ql,&qr,&val);
			if(ty==1){
				cover(1,n,1);
			}else{
				update(1,n,1);
			}
		}
		ans.clear();
		push_down_all(1,n,1);
		repn(i,0,ans.size()-1)
			printf("%d ",ans[i]);
		printf("\n");
	}
	return 0;
}