解题思路:
代码:
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll arr[2020][2020],n,m,k,q;
int main()
{
scanf("%lld%lld%lld%lld",&n,&m,&k,&q);
while(k--)
{
int x1,x2,y1,y2;
scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
arr[x1][y1]++;
arr[x2+1][y2+1]++;
arr[x1][y2+1]--;
arr[x2+1][y1]--;
}
for(int i=1;i<=n;++i)//将之前区间修改的影响向后传递
for(int j=1;j<=m;++j)
arr[i][j]+=arr[i-1][j]+arr[i][j-1]-arr[i-1][j-1];
for(int i=1;i<=n;++i)//求出前缀和
for(int j=1;j<=m;++j)
arr[i][j]+=arr[i-1][j]+arr[i][j-1]-arr[i-1][j-1];
while(q--)
{
int x1,x2,y1,y2;
scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
printf("%lld\n",arr[x2][y2]-arr[x2][y1-1]-arr[x1-1][y2]+arr[x1-1][y1-1]);
}
return 0;
}