CodeForces

题目链接：http://codeforces.com/problemset/problem/837/C

题目大意：选择两个纸条，使其能在板上同时贴下，并且是与板平行的，可以旋转90°，求可以贴下的两个纸条的最大面积。

解题思路：暴力枚举，然后讨论，详细见代码。

AC代码：

#include<cstdio>#include<cstring>#include<algorithm>using namespace std;struct Node{    int _x, _y;    Node(int x = 0, int y = 0) :_x(x), _y(y) {}}node[100 + 5];int main(){    int n, a, b;    scanf("%d%d%d", &n, &a, &b);    if (a > b)    {        int tmp = a;        a = b;        b = tmp;    }    for (int i = 0;i < n;++i)    {        int x, y;scanf("%d%d", &x, &y);        if (x > y)        {            int tmp = x;            x = y;            y = tmp;        }        node[i] = Node(x, y);    }    int mx = 0;    for (int i = 0;i<n;++i)        for (int j = i + 1;j < n;++j)        {            if (min(node[i]._x, node[j]._x) > a)                continue;            int area = node[i]._x*node[i]._y + node[j]._x*node[j]._y;            if (node[i]._x + node[j]._x <= a)            {                if (node[i]._y <= b&&node[j]._y <= b)                    mx = max(area, mx);            }            else            {                if (node[i]._x <= a&&node[j]._x <= a&&node[i]._y + node[j]._y <= b)                    mx = max(area, mx);                else if (node[j]._y <= a&&node[i]._y + node[j]._x <= b&&node[i]._x<=a)                    mx = max(area, mx);                else if (node[i]._y <= a&&node[i]._x + node[j]._y <= b&&node[j]._x<=a)                    mx = max(area, mx);                else if (node[i]._y <= a&&node[j]._y <= a&&node[i]._x + node[j]._x <= b)                    mx = max(area, mx);            }        }    printf("%d\n", mx);    return 0;}