解題報告:
思路:四個可能的區域取個最大值就是答案。
代碼:
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll a, b, x, y, t;
scanf("%lld", &t);
while(t--){
scanf("%lld%lld%lld%lld", &a, &b, &x, &y);
ll maxn = 0;++x;++y;
maxn = max(maxn, (x-1)*b);
maxn = max(maxn, (y-1)*a);
maxn = max(maxn, (b-y)*a);
maxn = max(maxn, (a-x)*b);
printf("%lld\n", maxn);
}
return 0;
}