代码求调

#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <queue>
#include <stack>
#include <cmath>
using namespace std;

const int MAXN=500005;
int n,m,a[MAXN],c[MAXN],k,x,y,z;

int look(int u){return u&(-u);}

void work(int u,int v){
	for(int i=u;i<=n;i+=look(i)) c[i]+=v;
}

long long getsum(int u){
	long long ans=0;
	for(int i=u;i>0;i-=look(i))
		ans+=c[i];
	return ans;
}

int main(){
	//freopen("stack.in","r",stdin);
	//freopen("stack.out","w",stdout);
	scanf("%d%d",&n,&m);
	while(m--){
		scanf("%d",&x);
		if(x==1){
			scanf("%d%d",&y,&z);
			work(y,z);
		}
		if(x==2){
			long long ans=0;
			int d,j;
			scanf("%d",&d);
			for(int i=0;i<d;i++){
				scanf("%d",&j);
				ans+=getsum(j)-getsum(j-1);
			}
			printf("%lld\n",ans);
		}
	}
	return 0;
}