树状数组板子2

区间修改，单点查询

#include<bits/stdc++.h>
using namespace std;
int s[1000010];
int main(){int n,m;cin>>n;int x,y=0,z;for(int i=1;i<=n;i++){cin>>x;z=x-y;y=x;int j=i;while(j<=n){s[j]+=z;j+=j&-j;}}cin>>m;for(int i=0;i<m;i++){string k;cin>>k;if(k=="ADD"){int l,r,t;cin>>l>>r>>t;r++;while(l<=n){s[l]+=t;l+=l&-l;}while(r<=n){s[r]-=t;r+=r&-r;}}if(k=="QUERY"){	int r;cin>>r;int ansr=0;while(r>0){ansr+=s[r];r-=r&-r;}cout<<ansr<<endl;	}	} 
}