- 一维前缀和
for(int i = 1; i <= n; i ++)
scanf("%d",&a[i]), sum[i] = sum[i - 1] + a[i];
- 查询[l, r]
sum[r] - sum[l - 1]
- 代码:
#include<iostream>
#include<cstdio>
using namespace std;
const int N = 100010;
int a[N], sum[N];//定义原数组,前缀和数组
int main(){
int n, m;
scanf("%d%d",&n,&m);
for(int i = 1; i <= n; i++) scanf("%d",&a[i]);
for(int i = 1; i <= n; i++) sum[i] = sum[i - 1] + a[i];//记录前缀和
int l, r;
while(m--){
scanf("%d%d",&l,&r);
printf("%d\n",sum[r] - sum[l - 1]);
}
return 0;
}
- 二维前缀和
sum[i][j] = sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1] + Map[i][j];
- 查询[x1, y1] 到 [x2, y2] 矩阵的和
sum[x2][y2] - sum[x1 - 1][y2] - sum[x2][y1 - 1] + sum[x1 -1][y1 - 1]
- 代码:
#include<iostream>
#include<cstdio>
using namespace std;
const int N = 1010;
int Map[N][N],sum[N][N];
int n, m, q;
int main(){
scanf("%d%d%d",&n,&m,&q);
for(int i = 1; i <= n; i++)
for(int j = 1; j <= m; j++)
scanf("%d",&Map[i][j]);
for(int i = 1; i <= n; i++)
for(int j = 1; j <= m; j++)
sum[i][j] = sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1] + Map[i][j];
int x1, y1, x2, y2;
while(q--){
scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
printf("%d\n",sum[x2][y2] - sum[x2][y1 - 1] - sum[x1 - 1][y2] + sum[x1 -1][y1 - 1]);
}
return 0;
}
差分:用于区间修改
- 一维差分
思路:先构建差值矩阵,再修改区间,计算前缀和
代码:
#include <iostream>
#include <cstdio>
using namespace std;
const int N = 100010;
int a[N], b[N];
int n, m;
void insert(int l, int r, int c){
b[l] += c;
b[r + 1] -= c;
}
int main(){
scanf("%d%d",&n,&m);
for(int i = 1; i <= n; i ++) scanf("%d",&a[i]),insert(i, i, a[i]);
int l, r, c;
while(m --){
scanf("%d%d%d",&l,&r,&c);
insert(l, r, c);
}
for(int i = 1; i <= n; i ++) b[i] += b[i - 1];
for(int i = 1; i <= n; i++) cout << b[i] << ' ';
return 0;
}
- 二维差分:
代码:
#include<iostream>
#include<cstdio>
using namespace std;
int n, m, q;
const int N = 1010;
int Map[N][N],M[N][N];
void insert(int x1, int y1,int x2, int y2, int c){//插入元素
M[x1][y1] += c;
M[x2 + 1][y1] -= c;
M[x1][y2 + 1] -= c;
M[x2 + 1][y2 + 1] += c;
}
int main(){
scanf("%d%d%d",&n,&m,&q);
for(int i = 1; i <= n; i++)
for(int j = 1; j <= m; j++)
scanf("%d",&Map[i][j]);
for(int i = 1; i <= n; i++)
for(int j = 1; j <= m; j++)
insert(i, j, i, j,Map[i][j]);
int x1, x2, y1, y2, c;
while(q--){
scanf("%d%d%d%d%d",&x1,&y1,&x2,&y2,&c);
insert(x1, y1, x2, y2, c);
}
for(int i = 1; i <= n ;i++)
for(int j = 1; j <= m; j++)
M[i][j] += M[i - 1][j] + M[i][j - 1] -M[i - 1][j - 1];
for(int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++)
printf("%d ", M[i][j]);
printf("\n");
}
return 0;
}
栗子:
ACWing 795 ~ 798