codeforce 837C

Posted 2020-10-02

题意给定一个长方形的范围；从给定的长方形中找两个占据面积最大的

wa多次 注意各个x,y的结合写错。。

代码：

#include<bits/stdc++.h>
using namespace std;
int n;
struct node
{
int x;
int y;
}ma[105];
int main()
{
int a,b;
while(cin>>n>>a>>b)
{
for(int i=0;i<n;i++)cin>>ma[i].x>>ma[i].y;
int sum=0;
for(int i=0;i<n;i++)
{
for(int j=i+1;j<n;j++)
{
int m=ma[i].x*ma[i].y+ma[j].y*ma[j].x;
int x1=ma[i].x+ma[j].y;
int x2=ma[i].x+ma[j].x;
int x3=ma[i].y+ma[j].x;
int x4=ma[i].y+ma[j].y;
if(x1<=a&&ma[i].y<=b&&ma[j].x<=b)sum=max(sum,m);
else if(x1<=b&&ma[i].y<=a&&ma[j].x<=a)sum=max(sum,m);
else if(x4<=a&&ma[i].x<=b&&ma[j].x<=b)sum=max(sum,m);
else if(x4<=b&&ma[i].x<=a&&ma[j].x<=a)sum=max(sum,m);
else if(x2<=a&&ma[i].y<=b&&ma[j].y<=b)sum=max(sum,m);
else if(x2<=b&&ma[i].y<=a&&ma[j].y<=a)sum=max(sum,m);
else if(x3<=a&&ma[i].x<=b&&ma[j].y<=b)sum=max(sum,m);
else if(x3<=b&&ma[i].x<=a&&ma[j].y<=a)sum=max(sum,m);
}

}
cout<<sum<<endl;
}
}