提示:文章写完后,目录可以自动生成,如何生成可参考右边的帮助文档
介绍:
- 一维差分:对一个初始全为0的数组,进行n此操作,每次使从l到r范围的数统一加上整数x。上述操作等价于每次在l位置加上x,r+1位置减去x,最后进行一遍前缀和。
- 等差数列差分:从l到r,依次加上公差为d,首项为s,末项为e的等差数列。进行n此操作后
等价与 l位置+s,l+1位置+d-s,r+1位置-d-e,r+2位置+e,n次操作后,最后进行两次前缀和。
经典题:https://www.luogu.com.cn/problem/P4231
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e8;
ll a[N];
ll l,r,s,e;
int main(){
int n,m;
scanf("%d %d",&n,&m);
while(m--){
scanf("%lld %lld %lld %lld",&l,&r,&s,&e);
ll d=(e-s)/(r-l);
a[l]+=s;
a[l+1]+=d-s;
a[r+1]-=d+e;
a[r+2]+=e;
}
ll max1=0,x=0;
for(int i=0;i<2;i++){
for(int j=1;j<=n;j++){
a[j]+=a[j-1];
if(i==1){
max1=max(max1,a[j]);
x^=a[j];
}
}
}
cout<<x<<' '<<max1;
return 0;
}
二维前缀和
https://leetcode.cn/problems/range-sum-query-immutable/description/
class NumMatrix {
vector<vector<int>> sum;
public:
NumMatrix(vector<vector<int>>& matrix) {
int m=matrix.size(),n=matrix[0].size();
sum.resize(m+1,vector<int>(n+1));
for(int i=0;i<m;i++){
for(int j=0;j<n;j++){
sum[i+1][j+1]=sum[i][j+1]+sum[i+1][j]-sum[i][j]+matrix[i][j];
}
}
}
int sumRegion(int r1, int c1, int r2, int c2) {
return sum[r2+1][c2+1]-sum[r2+1][c1]-sum[r1][c2+1]+sum[r1][c1];
}
};
二维差分
从左上角(a,b)到右下角(c,d)的矩形区域加上x,等价于(a,b)+x,(c+1,d+1)+x,(a,d+1)-x,(c+1,b)-x ,然后前缀和;
外面补一圈0,可以避免边界判断
用邮票贴满网格图
https://leetcode.cn/problems/stamping-the-grid/description/
class Solution {
public:
int m,n;
bool possibleToStamp(vector<vector<int>>& grid, int stampHeight, int stampWidth) {
m=grid.size(),n=grid[0].size();
vector<vector<int>> sum(m+1,vector<int>(n+1));
vector<vector<int>> diff(m+2,vector<int>(n+2));
for(int i=0;i<m;i++){
for(int j=0;j<n;j++){
sum[i+1][j+1]=grid[i][j];
}
}
build(sum);
for(int a=1,c=a+stampHeight-1;c<=m;a++,c++){
for(int b=1,d=b+stampWidth-1;d<=n;d++,b++){
if(sum[c][d]+sum[a-1][b-1]-sum[a-1][d]-sum[c][b-1]==0){
diff[a][b]+=1;
diff[c+1][d+1]+=1;
diff[a][d+1]-=1;
diff[c+1][b]-=1;
}
}
}
build(diff);
for(int i=0;i<m;i++){
for(int j=0;j<n;j++){
if(grid[i][j]==0 && diff[i+1][j+1]==0)return false;
}
}
return true;
}
void build(vector<vector<int>>& arr){
for(int i=1;i<arr.size();i++){
for(int j=1;j<arr[0].size();j++){
arr[i][j]=arr[i][j-1]+arr[i-1][j]-arr[i-1][j-1]+arr[i][j];
}
}
}
};
离散化技巧:最强祝福力场
https://leetcode.cn/problems/xepqZ5/description/
class Solution {
public:
int fieldOfGreatestBlessing(vector<vector<int>>& f) {
vector<long long> x;
vector<long long> y;
for(auto f1:f){
long long x0=f1[0],y0=f1[1],r=f1[2];
x.push_back((x0<<1)+r);
x.push_back((x0<<1)-r);
y.push_back((y0<<1)+r);
y.push_back((y0<<1)-r);
}
sort(x.begin(),x.end());
sort(y.begin(),y.end());
x.erase(unique(x.begin(),x.end()),x.end());
y.erase(unique(y.begin(),y.end()),y.end());
int nx=x.size();
int ny=y.size();
int diff[nx+2][ny+2];
memset(diff, 0, sizeof(diff));
for (auto &f1 : f) {
long long i = f1[0], j = f1[1], side = f1[2];
int r1 = lower_bound(x.begin(), x.end(), 2 * i - side) - x.begin();
int r2 = lower_bound(x.begin(), x.end(), 2 * i + side) - x.begin();
int c1 = lower_bound(y.begin(), y.end(), 2 * j - side) - y.begin();
int c2 = lower_bound(y.begin(), y.end(), 2 * j + side) - y.begin();
++diff[r1 + 1][c1 + 1];
--diff[r1 + 1][c2 + 2];
--diff[r2 + 2][c1 + 1];
++diff[r2 + 2][c2 + 2];
}
int ans=0;
for(int i=1;i<=nx;i++){
for(int j=1;j<=ny;j++){
diff[i][j]+=diff[i-1][j]+diff[i][j-1]-diff[i-1][j-1];
ans=max(ans,diff[i][j]);
}
}
return ans;
}
};
总结
注意:差分的前提是初始为0,若不为0,不要在原数组上进行差分,而是新建一个初始为0的数组,将其差分后加到原数组;