qq_35752161的博客

配合https://www.bilibili.com/video/av47331849食用#include<bits/stdc++.h> using namespace std;#define maxn 100000void build_tree(int arr[], int tree[], int node, int start, int end) { if (start == end) { tree[node] = arr[start]; return; }.

http://acm.hdu.edu.cn/showproblem.php?pid=1698题意:给一个序列，初始值都是１，有多组测试数据，每个数据序列长度为n，有m个操作，每个操作给出x,y,c,表示把[x,y]区间的值改为c,最后询问序列总和

http://acm.hdu.edu.cn/showproblem.php?pid=1754常规线段树，将tree中的求和改成求max就行。注意输入要循环，且判断EOF#include<iostream>#include<algorithm>#include<queue>#include<cstring>#include<map>#include<unordered_map>#include<set&g.

http://acm.hdu.edu.cn/showproblem.php?pid=1166常规线段树操作#include<iostream>#include<algorithm>#include<queue>#include<cstring>#include<map>#include<unordered_map>#include<set>#include<unordered_set>#