怎么优化才能AC

#include <bits/stdc++.h>
#define int long long 
using namespace std;
int n, q;
struct Tree
{
	int left, right;
	int max;
	int delta;
};
Tree tree[4 * 5000000 + 10];
int a[500010];
int queryAns = 0; 
void build (int id, int l, int r)
{
	tree[id].left = l;
	tree[id].right = r;
	
	if (l == r)
	{
		tree[id].max = a[l];
	}
	else
	{
		int mid = (l + r) / 2;
		build(id * 2, l, mid);
		build(id * 2 + 1, mid + 1, r);
		
		tree[id].max = max(tree[id * 2].max, tree[id * 2 + 1].max);
	}
}

void change(int id, int l, int r, int val)
{
	if (tree[id].left > r || tree[id].right < l)
		return ;
	if (tree[id].left >= l && tree[id].right <= r)
	{
//		cout << "DEBUG" << endl;
		tree[id].max = val;
		tree[id].delta = val;
	}
	if (tree[id].delta)
	{
		tree[id * 2].max = val;
		tree[id * 2 + 1].max = val;
		tree[id * 2].delta = tree[id].delta;
		tree[id * 2 + 1].delta = tree[id].delta;
		tree[id].delta = 0;
	}
	change(2 * id, l, r, val);
	change(2 * id + 1, l, r,val);
	tree[id].max = max(tree[id * 2].max, tree[id * 2 + 1].max);
}

void update(int id, int l, int r, int delta)
{
	if (tree[id].left > r || tree[id].right < l)
		return;
//	if (tree[id].left == tree[id].right)
//		tree[id].max += delta;
		
		
	if (tree[id].left >= l && tree[id].right <= r)
	{
		tree[id].max += delta;
		tree[id].delta += delta;
		return;
	}
	if (tree[id].delta)
	{
		tree[id * 2].max += tree[id].delta; // pushdown
		tree[id * 2 + 1].max += tree[id].delta; // pushdown
		tree[id * 2].delta += tree[id].delta;
		tree[id * 2 + 1].delta += tree[id].delta;
		tree[id].delta = 0;
	}
	
	update(2 * id, l, r, delta);
	update(2 * id + 1, l, r, delta);
	tree[id].max = max(tree[id * 2].max, tree[id * 2 + 1].max);
}


void query(int id, int l, int r)
{
	if (tree[id].left > r || tree[id].right < l)
		return;
	if (tree[id].left >= l && tree[id].right <= r)
	{
		queryAns = max(queryAns, tree[id].max);
		return;
	}
	if (tree[id].delta)
	{
		tree[id * 2].max += tree[id].delta;
		tree[id * 2].delta += tree[id].delta;
		tree[id * 2 + 1].max += tree[id].delta;
		tree[id * 2 + 1].delta += tree[id].delta;
		tree[id].delta = 0;
	}
	query(2 * id, l, r);
	query(2 * id + 1, l, r);
	tree[id].max = max(tree[id * 2].max , tree[id * 2 + 1].max);
} 

void print_tree(int id)
{
	if (tree[id].left == tree[id].right)
	{
		printf("id = %lld, max = %lld, tree[id].left = %lld, tree[id].right = %lld \n", id, tree[id].max, tree[id].left, tree[id].right);
//		cout << tree[id].max << " ";
		return;
	}
	printf("id = %lld, max = %lld, tree[id].left = %lld, tree[id].right = %lld \n", id, tree[id].max, tree[id].left, tree[id].right);
	print_tree(id * 2);
	print_tree(id * 2 + 1);
}

signed main()
{
	cin >> n >> q;
	for (int i = 1; i <= n; i++)
		scanf("%lld", &a[i]);
	
	build(1, 1, n);
//	print_tree(1);
	
	
	int op, x, l, r;
	while (q--)
	{
		cin >> op;
		if (op == 1)
		{
			scanf("%lld %lld %lld", &l, &r, &x);
			change(1, l, r, x);
//			print_tree(1);cout << endl;
		}
		else if (op == 2)
		{
			scanf("%lld %lld %lld", &l, &r, &x);
			update(1, l, r, x);
//			print_tree(1);cout << endl;
		}
		else
		{
			scanf("%lld %lld", &l, &r);
			queryAns = LLONG_MIN; query(1, l, r);
			printf("%lld\n", queryAns);
		}
	}
	return 0;
}