解:树状数组,区间修改,单点查询。维护A数组的差分数组B,如果要修改[L,R]都加上d,则令B[L]+=d,B[R+1]-=d即可。和维护前缀和一样,可以用树状数组来维护这个差分数组。
#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i = a;i<n;i++)
#define per(i,a,n) for(int i = n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
#define yes cout<<"YES"<<'\n';
#define no cout<<"NO"<<'\n';
#define endl '\n';
typedef vector<int> VI;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}());
const ll MOD=1000000007;
int rnd(int x) {return mrand() % x;}
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;};
ll lcm(int a,int b){return a*b/gcd(a,b);};
const int N=100010;
int n,m;
int a[N];
ll tr[N];
int lowbit(int x){
return x&-x;
}
void add(int x,int k){
for(int i=x;i<=n;i+=lowbit(i)){
tr[i]+=k;
}
}
ll query(int x){
ll res=0;
for(int i=x;i;i-=lowbit(i)) res+=tr[i];
return res;
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>n>>m;
rep(i,1,n+1) cin>>a[i];
rep(i,1,n+1) add(i,a[i]-a[i-1]);
rep(i,0,m){
char op;
int l,r,d;
cin>>op;
if(op=='C'){
cin>>l>>r>>d;
add(l,d);
add(r+1,-d);
}else{
cin>>l;
cout<<query(l)<<endl;
}
}
return 0;
}
时间复杂度:O(nlogn)。
空间复杂度:O(n)。