因为数据n开得很大,所以前缀和和差分是会超时的,而且注意单个数据最大会到1e12,所以开longlong数组,使用树状数组进行更新与求和
#include<iostream>
using namespace std;
#define lowbit(x) x&(-x)
const int N = 1e6+10;
typedef long long ll;
ll p[N];
int n,m;
inline void update(int x,int u){
for(int i=u;i<=n;i+=lowbit(i)){
p[i]+=x;
}
}
inline ll getsum(int r){
ll sum=0;
for(int i = r;i >0;i-=lowbit(i))sum+=p[i];
return sum;
}
int main(){
scanf("%d %d",&n,&m);
for(int i=1;i<=n;i++){
ll x;
scanf("%ld",&x);
update(x,i);
}
while(m--){
int a,b,c;
scanf("%d %d %d",&a,&b,&c);
if(a==1){
update(c,b);
} else {
printf("%ld\n",getsum(c)-getsum(b-1));
}
}
}
树状数组参考
https://blog.csdn.net/bestsort/article/details/80796531