暴力分

#include<bits/stdc++.h>
using namespace std;
int n,m,q;
long long a[1005],b[1005],c[1005][1005];
int main()
{
	cin>>n>>m>>q;
	for(int i=1;i<=n;i++)
		cin>>a[i];
	for(int i=1;i<=m;i++)
		cin>>b[i];
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
			c[i][j] = a[i]*b[j];
	while(q--){
		int l1,r1,l2,r2;
		long long ans = -1000000000000000001;
		cin>>l1>>r1>>l2>>r2;
		for(int i = l1;i<=r1;i++){
			//小L选取了第i行时，此时小 Q 会选取 C[i][l2]~C[i][r2] 之间的最小值 
			long long minn = c[i][l2]; 
			for(int j=l2+1;j<=r2;j++){
				minn=min(minn,c[i][j]);
			} 
			ans=max(ans,minn); 
		}
		
		cout<<ans<<"\n"; 
		
	}
	return 0;
}


···