题目：策略游戏

#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=5e5+10;
int n,m,q; 
int a[N],b[N];
int l1,r1,l2,r2;
int mx1[N][30],mi1[N][30],mx2[N][30],mi2[N][30],mz1[N][30],mf1[N][30];
const int mx=0x3f,mi=-0x3f;
signed main()
{
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin>>n>>m>>q;
    for(int i=1;i<=n;i++)
    {
    	cin>>a[i];
    	mx1[i][0]=mi1[i][0]=a[i];
    	if(a[i]<0)
    	{
    		mf1[i][0]=a[i];
		}else{
			mf1[i][0]=mi;
		}
		if(a[i]>=0)
		{
			mz1[i][0]=a[i];
		}else{
			mz1[i][0]=mx;
		}
	}
	for(int i=1;i<=m;i++)
	{
		cin>>b[i];
		mx2[i][0]=mi2[i][0]=b[i];
	}
	for(int j=1;j<=log2(n);++j)
	{
		for(int i=1;i+(1<<j)-1<=n;++i)
		{
			mx1[i][j]=max(mx1[i][j-1],mx1[i+(1<<(j-1))][j-1]);
			mi1[i][j]=min(mi1[i][j-1],mi1[i+(1<<(j-1))][j-1]);
			mf1[i][j]=max(mf1[i][j-1],mf1[i+(1<<(j-1))][j-1]);
			mz1[i][j]=min(mz1[i][j-1],mz1[i+(1<<(j-1))][j-1]);
		}
	}
	for(int j=1;j<=log2(m);++j)
	{
		for(int i=1;i+(1<<j)-1<=m;++i)
		{
			mx2[i][j]=max(mx2[i][j-1],mx2[i+(1<<(j-1))][j-1]);
			mi2[i][j]=min(mi2[i][j-1],mi2[i+(1<<(j-1))][j-1]);
		}
	}
	while(q--)
	{
		cin>>l1>>r1>>l2>>r2;
		int t1=log2(r1-l1+1),t2=log2(r2-l2+1);
		int fp1=max(mx1[l1][t1],mx1[r1-(1<<t1)+1][t1]);
		int fp2=min(mi1[l1][t1],mi1[r1-(1<<t1)+1][t1]);
		int fp3=max(mf1[l1][t1],mf1[r1-(1<<t1)+1][t1]);
		int fp4=min(mz1[l1][t1],mz1[r1-(1<<t1)+1][t1]);
		int sp1=max(mx2[l2][t2],mx2[r2-(1<<t2)+1][t2]);
		int sp2=min(mi2[l2][t2],mi2[r2-(1<<t2)+1][t2]);
		int ans=mi;
		if(fp1>=0)
		{
			ans=max(ans,fp1*sp2);
		}else{
			ans=max(ans,fp1*sp1);
		}
		if(fp2>=0)
		{
			ans=max(ans,fp2*sp2);
		}else{
			ans=max(ans,fp2*sp1);
		}
		if(fp3!=mi)
		{
			if(fp3>=0)
			{
				ans=max(ans,fp3*sp2);
			}else{
				ans=max(ans,fp3*sp1);
			}
		}
		if(fp4!=mx)
		{
			if(fp4>=0)
			{
				ans=max(ans,fp4*sp2);
			}else{
				ans=max(ans,fp4*sp1);
			}
		}
		cout<<ans<<endl;
	}
  	return 0;
}