![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
树状数组
crazy morning
去西之西处,驾驭长风
展开
-
P3368 【模板】树状数组 2
题目题目思路相比板子1,我们多了差分,这时前缀和就是某个点了。code:#include<iostream>#include<cstdio>using namespace std;long long a[500002],n,m,last,now;void add(int x, long long num){ while (x<=n) { a[x]+=num; x+=x&(-x); }}void f原创 2021-03-10 21:23:06 · 60 阅读 · 0 评论 -
P4514 上帝造题的七分钟
题目题目思路联系模板2的思路,我们可以做一个二维树状数组+差分。code:#include<cctype>#include<cerrno>#include<cfloat>#include<ciso646>#include<climits>#include<clocale>#include<cmath>#include<csetjmp>#include<csignal>#in原创 2021-03-10 21:26:11 · 90 阅读 · 0 评论 -
P3374 【模板】树状数组 1
题目题目思路板子不解释。code:#include<iostream>#include<algorithm>using namespace std;int n,m,Quant,Ask,XJQ,AK[500001];void add(int x,int WJ){ while (x<=n) { AK[x]+=WJ; x+=x&-x; } return;}int QuantAsk(int x){ int ans=0; while原创 2021-03-10 21:20:12 · 59 阅读 · 0 评论