一维前缀和
int n, m, q[N], s[N];
cin >> n >> m;
for(int i = 1; i <= n; i++) /* 前缀和初始化从下标1开始 */
{
scanf("%d", &q[i]);
s[i] = s[i - 1] + q[i];
}
while(m--)
{
int l,r;
cin >> l >> r; /* 区间[l,r]的和 */
cout << s[r] - s[l - 1] << endl;
}
二维前缀和
int n, m, q[N][N], s[N][N];
cin >> n >> m;
/* 二维前缀和的存储 */
for(int i = 1; i <= n; i++)
for(int j = 1; j <= m; j++) {
cin >> q[i][j];
s[i][j] = s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1] + q[i][j];
}
/* 求某个子矩阵的和 */
int x1, x2, y1, y2; /* 分别为矩阵的左上角和右下角的坐标 */
cin >> x1 >> y1 >> x2 >> y2;
cout << s[x2][y2] - s[x1 - 1][y2] - s[x2][y1 - 1] + s[x1 - 1][y1 - 1] << endl;
相关题目:
P3397 地毯
P1719 最大加权矩形
P2004 领地选择