Submission
Status:
[PPPP][PPPP][PPPP][PPPP][PPPP][PPPP][PPPP][-SSS]
Subtask/Task Score:
{13/13}{13/13}{13/13}{13/13}{13/13}{13/13}{13/13}{0/13}
Score: 91
User: boommmmm
Problemset: ขนมปัง
Language: cpp
Time: 0.003 second
Submitted On: 2025-10-17 10:04:26
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,m,w,h,mx=INT_MIN,mx2=INT_MIN;
cin >> w >> h >> n >> m;
vector<int> v(n+2);
vector<int> vec(m+2);
v[0]=0; vec[0]=0;
v[n+1]=w; vec[n+1]=h;
for(int i=1;i<=n;i++){
cin >> v[i];
}
for(int i=1;i<=m;i++){
cin >> vec[i];
}
int area,z,y;
for(int i=0;i<=n;i++){
for(int j=0;j<=m;j++){
area=(( v[i+1]-v[i] ) * ( vec[j+1]-vec[j] ));
if(area>mx){
mx=area;
z=i;
y=j;
}
}
}
for(int i=0;i<=n;i++){
for(int j=0;j<=m;j++){
area=(( v[i+1]-v[i] ) * ( vec[j+1]-vec[j] ));
if(area==mx && (i != z || j != y)){
mx2=mx;
}
else if(area<mx && area>mx2){
mx2=area;
}
}
}
cout << mx << " " << mx2;
return 0;
}