795. 前缀和
# include <iostream>
const int N = 100010;
int a[N], s[N];
int n,m;
int main()
{
scanf("%d %d", &n, &m);
for(int i = 1; i <= n; i++)
{
scanf("%d",&a[i]);
s[i] = s[i-1] + a[i];//计算前缀和数组
}
int l, r;
while(m--)
{
scanf("%d %d",&l,&r);
printf("%d\n",s[r] - s[l-1]);
}
}
796. 子矩阵的和
输入样例:
3 4 3
1 7 2 4
3 6 2 8
2 1 2 3
1 1 2 2
2 1 3 4
1 3 3 4
输出样例:
17
27
21
# include <iostream>
using namespace std;
const int N = 1010;
int a[N][N], s[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",&a[i][j]);
//计算前缀和
s[i][j] = s[i][j-1] + s[i-1][j] - s[i-1][j-1] + a[i][j];
}
while(q--)
{
int x1,y1,x2,y2;
scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
//按照公式输出对应的结果
printf("%d\n",s[x2][y2] - s[x2][y1-1] - s[x1-1][y2] + s[x1-1][y1-1]);
}
return 0;
}
797. 差分
输入样例:
6 3
1 2 2 1 2 1
1 3 1
3 5 1
1 6 1
输出样例:
3 4 5 3 4 2
参考详解链接:https://www.acwing.com/solution/content/26588/
这里补充说明下初始化差分数组的过程:
我们想对已知的输入数组的某个区域+c,可以先对其差分数组进行变化,再求差分数组的前缀和就可得到最终变化后的数组a了。那么就要求出输入数组的差分数组,此处有个小技巧,首先假设其前缀和数组全为0,那么其差分矩阵也全为0;此时再对数组b进行插入操作(再次求前缀和的时候也就相当于对a进行了插入),对b插入后根据给定的条件对数组b进行更新,这时再求其前缀和即可得到操作后的数组a。
# include <iostream>
using namespace std;
const int N = 100010;
int a[N],b[N];
void insert(int l,int r,int c)
{
b[l] += c;
b[r + 1] -= c;
}
int main()
{
int n,m;
scanf("%d%d",&n,&m);
for(int i = 1; i <= n; i++)
{
scanf("%d",&a[i]);
insert(i,i,a[i]);//初始化差分数组
}
while(m--)
{
int l,r,c;
scanf("%d%d%d",&l,&r,&c);
insert(l,r,c);
}
for(int i = 1; i <=n; i++)
{
b[i] += b[i-1];
printf("%d ",b[i]);
}
return 0;
}
798. 差分矩阵
输入样例:
3 4 3
1 2 2 1
3 2 2 1
1 1 1 1
1 1 2 2 1
1 3 2 3 2
3 1 3 4 1
输出样例:
2 3 4 1
4 3 4 1
2 2 2 2
# include <iostream>
using namespace std;
const int N = 1010;
int a[N][N],b[N][N];
void insert(int x1, int y1, int x2, int y2, int c)
{
b[x1][y1] += c;
b[x2+1][y1] -= c;
b[x1][y2+1] -= c;
b[x2+1][y2+1] +=c;
}
int main()
{
int n,m,q;
scanf("%d%d%d",&n,&m,&q);
for(int i = 1; i <= n; i++)
for(int j = 1; j <= m; j++)
{
scanf("%d",&a[i][j]);//输入
insert(i,j,i,j,a[i][j]);//初始化差分数组b
}
while(q--)
{
int x1, y1, x2, y2, c;
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++)
{//求其前缀和矩阵,并输出
b[i][j] += b[i][j-1] + b[i-1][j] - b[i-1][j-1];
printf("%d ",b[i][j]);
}
cout<<endl;
}
}