牛客寒假算法基础集训营6 E. 海啸(二维数组+容斥)

#include <bits/stdc++.h>
#define ll long long
using namespace std;
int n,m,d,t;
 
int main()
{
  scanf("%d%d%d",&n,&m,&d);
  int pre[n + 5][m + 5];
  int ans = 0;
  memset(pre,0,sizeof(pre));
  for(int i=1;i<=n;i++){
    for(int j=1;j<=m;j++){
      int x;
      scanf("%d", &x);
      if(x >= d)pre[i][j] = 1 + pre[i-1][j] + pre[i][j-1] - pre[i-1][j-1];
      else pre[i][j] = pre[i-1][j] + pre[i][j-1] - pre[i-1][j-1];
    }
  }
  scanf("%d",&t);
  while(t--){
    int x1,y1,x2,y2;
    scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
    printf("%d\n", pre[x2][y2] - pre[x2][y1-1] - pre[x1-1][y2] + pre[x1-1][y1-1]);
  }
  return 0;
}