#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
const int maxn = 1001;
const int N = 5;
int rsum[maxn][maxn][N],d[maxn][maxn][N];
int a[maxn][maxn],SUM[maxn][maxn],n,m,Q;
int sum(int i,int x,int y,int d){
return rsum[i][y][d] - rsum[i][x-1][d];
}
int cal(int x,int y,int D){
int res = 0;
int step = 0;
for(;;){
if(x - step < 1) break;
int L = max(1,y-step);
int R = min(m,y+step);
res +=(SUM[x-step][R] - SUM[x-step][L-1]);
step+=D;
}
return......
阅读全文