```cpp
#include<iostream>
#include<climits>
#define N 100005
#define int long long
using namespace std;
int n, m, cnt1, cnt2, q;
int a[N], b[N], sum1[N], sum2[N];
struct tree{
int maxn, minn;
}t1[N << 2], t2[N << 2], t3[N << 2], t4[N << 2];//a b min+a max-a
void pushup(int now, tree t[], int p){
if (p == 0){
int x = t[now * 2].minn, y = t[now * 2 + 1].minn;
if (x >= 0 && y >= 0){
t[now].minn = min(x, y);
}
if (x >= 0 && y < 0 || x < 0 && y >= 0){
t[now].minn = max(x, y);
}
return;
}
if (p == 1){
int x = t[now * 2].maxn, y = t[now * 2 + 1].maxn;
if (x < 0 && y < 0){
t[now].maxn = max(x, y);
}
if (x < 0 && y >= 0 || x >= 0 && y < 0){
t[now].maxn = min(x, y);
}
return;
}
t[now].maxn = max(t[now * 2].maxn, t[now * 2 + 1].maxn);
t[now].minn = min(t[now * 2].minn, t[now * 2 + 1].minn);
}
void build(int now, int l, int r, int x[], tree t[], int p){
if (l == r){
if (p == 0){
if (x[l] >= 0){
t[now].minn = x[l];
}
return;
}
if (p == 1){
if (x[l] < 0){
t[now].maxn = x[l];
}
return;
}
t[now].maxn = t[now].minn = x[l];
return;
}
int mid = (l + r) >> 1;
build(now * 2, l, mid, x, t, p);
build(now * 2 + 1, mid + 1, r, x, t, p);
pushup(now, t, p);
}
int query1(int now, int l, int r, int x, int y, tree t[]){
if (x <= l && r <= y){
return t[now].maxn;
}
int mid = (l + r) >> 1, ret = LONG_LONG_MIN;
if (x <= mid){
ret = max(ret, query1(now * 2, l, mid, x, y, t));
}
if (mid + 1 <= y){
ret = max(ret, query1(now * 2 + 1, mid + 1, r, x, y, t));
}
return ret;
}
int query2(int now, int l, int r, int x, int y, tree t[]){
if (x <= l && r <= y){
return t[now].minn;
}
int mid = (l + r) >> 1, ret = LONG_LONG_MAX;
if (x <= mid){
ret = min(ret, query2(now * 2, l, mid, x, y, t));
}
if (mid + 1 <= y){
ret = min(ret, query2(now * 2 + 1, mid + 1, r, x, y, t));
}
return ret;
}
int get_ans(int ax, int ay, int bx, int by, int l1, int r1, int l2, int r2){
if (ax >= 0 && ay >= 0 && bx >= 0 && by <= 0){
// if (sum1[r1] - sum1[l1 - 1] != 0){
// return 0;
// }else{
return 1ll * ay * by;
// }
}
if (ax <= 0 && ay <= 0 && bx >= 0 && by <= 0){
// if (sum1[r1] - sum1[l1 - 1] != 0){
// return 0;
// }else{
return 1ll * ax * bx;
// }
}
if (ax >= 0 && ay >= 0 && bx >= 0 && by >= 0){
// if (sum2[r2] - sum2[l2 - 1] != 0){
// return 0;
// }else{
return 1ll * ax * by;
// }
}
if (ax >= 0 && ay <= 0 && bx >= 0 && by >= 0){
// if (sum2[r2] - sum2[l2 - 1] != 0){
// return 0;
// }else{
return 1ll * ax * by;
// }
}
if (ax >= 0 && ay <= 0 && bx <= 0 && by <= 0){
// if (sum2[r2] - sum2[l2 - 1] != 0){
// return 0;
// }else{
return 1ll * ay * bx;
// }
}
if (ax <= 0 && ay <= 0 && bx <= 0 && by <= 0){
// if (sum2[r2] - sum2[l2 - 1] != 0){
// return 0;
// }else{
return 1ll * ay * bx;
// }
}
}
signed main(){
cin >> n >> m >> q;
for (int i = 1; i <= n; i++){
cin >> a[i];
sum1[i] = sum1[i - 1] + (a[i] == 0);
}
for (int i = 1; i <= m; i++){
cin >> b[i];
sum2[i] = sum2[i - 1] + (b[i] == 0);
}
build(1, 1, n, a, t1, -1);
build(1, 1, m, b, t2, -1);
for (int i = 1; i <= n << 2; i++){
t3[i].minn = LONG_LONG_MAX;
t4[i].maxn = LONG_LONG_MIN;
}
build(1, 1, n, a, t3, 0);
build(1, 1, n, a, t4, 1);
for (int i = 1; i <= q; i++){
int l1, r1, l2, r2;
cin >> l1 >> r1 >> l2 >> r2;
int ax, ay, bx, by;
ax = query1(1, 1, n, l1, r1, t1), ay = query2(1, 1, n, l1, r1, t1);
bx = query1(1, 1, m, l2, r2, t2), by = query2(1, 1, m, l2, r2, t2);
if (ax >= 0 && ay <= 0 && bx >= 0 && by <= 0){
int x = query2(1, 1, n, l1, r1, t3), y = query1(1, 1, n, l1, r1, t4);
cout << 1ll * max(x * by, y * bx) << endl;
}else{
cout << get_ans(ax, ay, bx, by, l1, r1, l2, r2) << endl;
}
}
}
```
by bryce @ 2022-11-27 10:15:33
此贴终
------------
by bryce @ 2022-12-01 12:04:29
@[bryce](/user/217289) 贴->帖
by CJ_Fu @ 2023-07-13 09:54:51