https://blog.csdn.net/csyifanZhang/article/details/105187309?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522159080868919195265908229%2522%252C%2522scm%2522%253A%252220140713.130102334.pc%255Fblog.%2522%257D&request_id=159080868919195265908229&biz_id=0&utm_medium=distribute.pc_search_result.none-task-blog-2~blog~first_rank_v2~rank_blog_v1-1-105187309.pc_v2_rank_blog_v1&utm_term=%E7%BA%BF%E6%AE%B5%E6%A0%91

↑总结了好久的线段树

ps：不用longlong毁一生

#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<queue>
#include<set>
#include<string>
#include<string.h>
#include<cmath>
using namespace std;

#define ll long long
#define inf 0x3f3f3f3f
#define MAX 100006
#define vec vector<int>
#define P pair<int,int>

ll t[MAX * 4], tag[MAX * 4], a[MAX], n, m;
inline ll lc(ll p) { return p << 1; }
inline ll rc(ll p) { return p << 1 | 1; }
inline void p...