差分算法
by lqx
一维差分
肖恩的投球游戏
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N=1e5+9;
int a[N],d[N],n,q;
signed main(){
cin>>n>>q;
for(int i=1;i<=n;i++){
cin>>a[i];
d[i]=a[i]-a[i-1];
}
while(q--){
int l,r,c;cin>>l>>r>>c;
d[l]+=c;
d[r+1]-=c;
}
for(int i=1;i<=n;i++){
a[i]=a[i-1]+d[i];
cout<<a[i]<<' ';
}
}
二维差分
肖恩的投球游戏加强版
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=1009;
int n,m,q,a[N][N],d[N][N];
signed main(){
cin>>n>>m>>q;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++){
cin>>a[i][j];
d[i][j]+=a[i][j];
d[i+1][j]-=a[i][j];
d[i][j+1]-=a[i][j];
d[i+1][j+1]+=a[i][j];
}
while(q--){
int x1,y1,x2,y2,c;cin>>x1>>y1>>x2>>y2>>c;
d[x1][y1]+=c;
d[x1][y2+1]-=c;
d[x2+1][y1]-=c;
d[x2+1][y2+1]+=c;
}
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
a[i][j]=a[i-1][j]+a[i][j-1]-a[i-1][j-1]+d[i][j];
cout<<a[i][j]<<' ';
}
cout<<'\n';
}
return 0;
}