Submission

Score: 13

User: TiaopedNPx

Problemset: ขนมปัง

Language: cpp

Time: 0.002 second

Submitted On: 2025-10-17 14:13:41

#include<bits/stdc++.h>
using namespace std;

int main(){
	int w,h,n,m,mxw[2]={0},mxh[2]={0};	cin >> w >> h >> m >> n;
	vector<int> wid(m+2),hig(n+2);
	wid[0] = hig[0] = 0;	wid[m+1]= w;	hig[n+1] = h;
	for(int i=1;i<m+2;i++){
		if(i<m+1)	cin >> wid[i];
		if(mxw[0]<wid[i]-wid[i-1]) mxw[0] = wid[i]-wid[i-1];
		else if(mxw[1]<wid[i]-wid[i-1]) mxw[1] = wid[i]-wid[i-1];
	}
//	cout << mxw[0] << " " << mxw[1] << endl;
	for(int i=1;i<n+2;i++){
		if(i<n+1)	cin >> hig[i];
		if(mxh[0]<hig[i]-hig[i-1]) mxh[0] = hig[i]-hig[i-1];
		else if(mxh[1]<hig[i]-hig[i-1]) mxh[1] = hig[i]-hig[i-1];
	}
//	cout << mxh[0] << " " << mxh[1] << endl;
	int MX1=0,MX2=0;
	for(int i=0;i<2;i++){
		for(int j=0;j<2;j++){
			if(MX1<mxw[i]*mxh[j]) MX1 = mxw[i]*mxh[j];
			else if(MX2<mxw[i]*mxh[j]) MX2 = mxw[i]*mxh[j];
		}
	}
	cout << MX1 << " " << MX2;
	return 0;
}