题意:
用一个给定长L的数组,对角不断填充一个矩阵,求矩阵中某个子矩阵的和。
思路:
因为是通过同一个数组有规律的填充矩阵,同时子矩阵的范围也很大,所以思考是否会出现很多相同的矩阵。
然后发现填充矩阵由长为2*L的矩阵重复出现构成,预处理出长2*L的矩阵的二维前缀和,就可以推出所有子矩阵的值。
代码:
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <cstring>
#include <cctype>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <map>
#include <list>
#include <set>
#include <stack>
#include <queue>
#include <string>
#include <sstream>
#define pb push_back
#define X first
#define Y second
#define ALL(x) x.begin(),x.end()
#define INS(x) inserter(x,x.begin())
#define pii pair<int,int>
#define qclear(a) while(!a.empty())a.pop();
#define lowbit(x) (x&-x)
#define sd(n) scanf("%d",&n)
#define sdd(n,m) scanf("%d%d",&n,&m)
#define sddd(n,m,k) scanf("%d%d%d",&n,&m,&k)
#define mst(a,b) memset(a,b,sizeof(a))
#define cout3(x,y,z) cout<<x<<" "<<y<<" "<<z<<endl
#define cout2(x,y) cout<<x<<" "<<y<<endl
#define cout1(x) cout<<x<<endl
#define IOS std::ios::sync_with_stdio(false)
#define SRAND srand((unsigned int)(time(0)))
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
using namespace std;
const double PI=acos(-1.0);
const int INF=0x3f3f3f3f;
const ll mod=1e9+7;
const double eps=1e-8;
const int maxn=1005;
const int maxm=10005;
int cursor = 0;
int M[maxn][maxn];
int sum[maxn][maxn];
int A[maxn];
int L;
int len;
void init() {
cursor=0;
len=2*L;
for (int i = 0;i<2*len; ++i) {
for (int j = 0; j <= i; ++j) {
M[j][i - j] = A[cursor];
cursor = (cursor + 1) % L;
}
}
for(int i=0;i<len;i++){
sum[i][0]=M[i][0];
for(int j=1;j<len;j++){
sum[i][j]=sum[i][j-1]+M[i][j];
}
if(i!=0){
for(int j=0;j<len;j++){
sum[i][j]+=sum[i-1][j];
}
}
}
}
ll cal(int x,int y){
if(x<0||y<0)return 0;
ll cntx=x/len;
int xx=x%len;
ll cnty=y/len;
int yy=y%len;
ll res=sum[xx][yy]+cntx*sum[len-1][yy]+cnty*sum[xx][len-1]+cntx*cnty*sum[len-1][len-1];
return res;
}
void solve() {
init();
int t;
sd(t);
while(t--){
sd(L);
for(int i=0;i<L;i++){
sd(A[i]);
}
init();
int q;
sd(q);
for(int i=0;i<q;i++){
int x1,y1,x2,y2;
sdd(x1,y1);
sdd(x2,y2);
ll ans=cal(x2,y2)-cal(x1-1,y2)-cal(x2,y1-1)+cal(x1-1,y1-1);
printf("%lld\n",ans);
}
}
return ;
}
int main() {
#ifdef LOCAL
freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
#else
// freopen("","r",stdin);
// freopen("","w",stdout);
#endif
solve();
return 0;
}