0pts求调 悬赏关注

#include<bits/stdc++.h>
using namespace std;
int n,m,q;
long long a[100100],b[100100];
long long l1,l2,r1,r2;
long long logn[1000000];
long long f1[100100][30][5];//区间最大的负值0和最小的正值1 
long long f2[100100][30][5];
const int logN =20;
void pre()
{
	logn[1] = 0;
	logn[2] = 1;
	for(int i=3;i<=1000000;i++)
	{
		logn[i] = logn[i/2]+1;
	}
	return ;
} 
void ST1()//A序列 
{
	for(int i=1;i<=n;i++)
	{
		f1[i][0][0] = -1e12;
		f1[i][0][1] = 1e12;
	}
	for(int i=1;i<=n;i++)
	{
		if(a[i]<0)f1[i][0][0] = a[i];
		else f1[i][0][1] = a[i];
		f1[i][0][2] = f1[i][0][3] = a[i];
	}
	for(int j=1;j<=logN;j++)
	{
		for(int i=1;i+(1<<j)-1<=n;i++)
		{
			f1[i][j][0] = max(f1[i][j-1][0],f1[i+(1<<(j-1))][j-1][0]);
			f1[i][j][1] = min(f1[i][j-1][1],f1[i+(1<<(j-1))][j-1][1]);
			f1[i][j][2] = max(f1[i][j-1][2],f1[i+(1<<(j-1))][j-1][2]);
			f1[i][j][3] = min(f1[i][j-1][3],f1[i+(1<<(j-1))][j-1][3]);
		}
	}
	return ;
}
void ST2()//B序列 
{
	for(int i=1;i<=m;i++)
	{
		f2[i][0][0] = b[i];
		f2[i][0][1] = b[i];
	}
	for(int j=1;j<=logN;j++)
	{
		for(int i=1;i+(1<<j)-1<=m;i++)
		{
			f2[i][j][0] = max(f2[i][j-1][0],f2[i+(1<<(j-1))][j-1][0]);
			f2[i][j][1] = min(f2[i][j-1][1],f2[i+(1<<(j-1))][j-1][1]);
		}
	}
	return ;
}
int main()
{
	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];
	for(int i=1;i<=m;i++) cin>>b[i];
	pre();
	ST1();
	ST2();
	for(int i=1;i<=q;i++)
	{
		cin>>l1>>r1>>l2>>r2;
		long long t1 = logn[r1-l1+1];
		long long t2 = logn[r2-l2+1];
		long long ma1 = max(f1[l1][t1][0],f1[r1-(1<<t1)+1][t1][0]);
		long long mi1 = min(f1[l1][t1][1],f1[r1-(1<<t1)+1][t1][1]);
		long long qma1 = max(f1[l1][t1][2],f1[r1-(1<<t1)+1][t1][2]);
		long long qmi1 = min(f1[l1][t1][3],f1[r1-(1<<t1)+1][t1][3]); 
		long long ma2 = max(f2[l2][t2][0],f2[r2-(1<<t2)+1][t2][0]);
		long long mi2 = min(f2[l2][t2][1],f2[r2-(1<<t2)+1][t2][1]);
		//cout<<ma1<<" "<<mi1<<" "<<qma1<<" "<<qmi1<<endl;
		long long ans = -1e12;
		ans = max(ans,qma1*(qma1>=0 ? mi2 : ma2));
		ans = max(ans,qmi1*(qmi1>=0 ? mi2 : ma2));
		if(ma1 != -1e12)
		{
			ans = max(ans,ma1*(qma1>=0 ? mi2 : ma2));
		}
		if(mi1 != 1e12)
		{
			ans = max(ans,mi1*(qma1>=0 ? mi2 : ma2));
		}
		cout<<ans<<endl;
	}
	return 0;
}