传送门
Description
You have N integers, A1, A2, … , AN. You need to deal with two kinds of operations. One type of operation is to add some given number to each number in a given interval. The other is to ask for the sum of numbers in a given interval.
Input
The first line contains two numbers N and Q. 1 ≤ N,Q ≤ 100000.
The second line contains N numbers, the initial values of A1, A2, … , AN. -1000000000 ≤ Ai ≤ 1000000000.
Each of the next Q lines represents an operation.
“C a b c” means adding c to each of Aa, Aa+1, … , Ab. -10000 ≤ c ≤ 10000.
“Q a b” means querying the sum of Aa, Aa+1, … , Ab.
Output
You need to answer all Q commands in order. One answer in a line.
Sample Input
10 5
1 2 3 4 5 6 7 8 9 10
Q 4 4
Q 1 10
Q 2 4
C 3 6 3
Q 2 4
Sample Output
4
55
9
15
Hint
The sums may exceed the range of 32-bit integers.
这道题是区间修改加区间查询,可以用树状数组,也可以用线段树来做
关键的部分就是要用差分的思想,然后累加求和
AC代码如下
#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#define int long long
typedef long long ll;
const int MANX=1e5+10;
using namespace std;
int a[MANX],sum1[MANX],sum2[MANX],n,m;
inline int lowbit(int x){
return x&(-x);
}
inline void update(int i,int k){
int x=i;
while(i<=n){
sum1[i]+=k;
sum2[i]+=(x-1)*k;
i+=lowbit(i);
}
}
inline int getsum(int i){
int ans=0,x=i;
while(i>0){
ans+=x*sum1[i]-sum2[i];
i-=lowbit(i);
}
return ans;
}
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin>>n>>m;
for(int i=1;i<=n;i++){
cin>>a[i];
update(i,a[i]-a[i-1]) ;
}
string s;
while(m--){
cin>>s;
if(s=="Q"){
int x,y;
cin>>x>>y;
cout<<getsum(y)-getsum(x-1)<<endl;
}
else if(s=="C"){
int x,y,z;
cin>>x>>y>>z;
update(x,z);
update(y+1,-z);
}
}
return 0;
}