帅气廖鹏飞

#include"iostream"using namespace std;const int maxn=1e4+5;struct Tree{ int l,r,Max;};Tree tree[maxn<<2];int a[maxn];void BuildTree(int id,int L,int R){ tree[id].l=L; tree[id].r=R;

include”iostream”include”vector”include”algorithm”include”string.h”using namespace std; const int maxn=5e4+5; struct Tree { int l,r,c; }; int Size; Tree tree[maxn*30]; int a[

http://acm.hdu.edu.cn/showproblem.php?pid=4348#include"iostream"#include"cstdio"using namespace std;const int maxn=1e5+5;int Scan(){ int res = 0, flag = 0; char ch; if((ch = getchar...

文章目录C-红球进黑洞E-换个角度思考C-红球进黑洞https://ac.nowcoder.com/acm/contest/275/C题意：两种操作：操作1：是求区间[L,R]的和操作2：把[L,R]区间的每个数都异或一个数 k最开始没反应过来，异或的和不等于和的异或，很傻逼地写了半天。。。最会发现不会诶T_T然后看题解，真的很厉害，他是保存每段区间内，各个位上有多少个1，然后通过...

文章目录题目链接：hdu4417题目链接：hdu 4417 Super Mario牛客小白月赛9 Ehdu4417/*主席树求[L,R]内小于等于x的个数*/#include"bits/stdc++.h"using namespace std;typedef long long LL;const int maxn=2e6+5;int Ls[maxn],Rs[maxn],tree...