UVA1616-Caravan Robbers（枚举）

Problem UVA1616-Caravan Robbers

Accept: 160  Submit: 1156
Time Limit: 3000 mSec

Problem Description

OnceuponatimetherewasagreedyKing who ordered his chief Architect to build a field for royal cricket inside his park. The Kingwassogreedy, thathewouldnotlisten to his Architect’s proposals to build a fieldrightintheparkcenterwithpleasant patterns of trees specially planted around and beautiful walks inside tree alleys for spectators. Instead, he ordered neither to cut nor to plant even a single tree in his park, but demanded to build the largest possible cricket field for his pleasure. If the Kind finds that the Architect hasdaredtotouchevenasingletreeinhis park or designed a smaller field that it was possible, then the Architect will loose his head. Moreover, he demanded his Architect to introduce at once a plan of the field with its exact location and size. YourtaskistohelppoorArchitecttosavehishead,bywritingaprogramthatwillfindthemaximum possible size of the cricket field and its location inside the park to satisfy King’s requirements. Thetaskissomewhatsimplifiedbythefact,thatKing’sparkhasarectangularshapeandissituated onaflatground. Moreover, park’sbordersareperfectlyalignedwithNorth-SouthandEast-Westlines. At the same time, royal cricket is always played on a square field that is also aligned with North-South andEast-Westlines. ArchitecthasalreadyestablishedaCartesiancoordinatesystemandhasprecisely measured the coordinates of every tree. This coordinate system is, of course, aligned with North-South and East-West lines. Southwestern corner of the park has coordinates (0, 0) and Northeastern corner of the part has coordinates (W,H), where W and H are the park width and height in feet respectively. For this task, you may neglect the diameter of the trees. Trees cannot be inside the cricket field, butmaybesituatedonitsside. Thecricketfieldmayalsotouchpark’sborder, butshallnotlieoutside the park.

Input

The input begins with a single positive integer on a line by itself indicating the number of the cases following, each of them as described below. This line is followed by a blank line, and there is also a blank line between two consecutive inputs. The first line of the input file contains three integer numbers N, W, and H, separated by spaces. N (0 ≤ N ≤ 100) is the number of trees in the park. W and H (1 ≤ W,H ≤ 10000) are the park width and height in feet respectively. Next N lines describe coordinates of trees in the park. Each line contains two integer numbers Xi and Yi separated by a space (0 ≤ Xi ≤ W, 0 ≤ Yi ≤ H) that represent coordinates of i-th tree. All trees are located at different coordinates.

 Output

For each test case, the output must follow the description below. The outputs of two consecutive cases will be separated by a blank line. Write to the output file a single line with three integer numbers P, Q, and L separated by spaces, where (P,Q) are coordinates of the cricket field Southwestern corner, and L is a length of its sides. If there are multiple possible field locations with a maximum size, then output any one. Note: This is a sample input and output that corresponds to the park plan that is shown on the picture.

 

 Sample Input

1
7 10 7
3 2
4 2
7 0
7 3
4 5
2 4
1 7

 

Sample Output

4 3 4

题解：本来想用单调栈，一看数据范围，果断枚举，枚举横坐标的两个端点，遍历所有可能的纵坐标，更新答案即可。

 #include <bits/stdc++.h>

 using namespace std;

 const int maxn =  + ;

 int n, r, c;

 struct Tree {
     int x, y;
     Tree() {}
     Tree(int _x, int _y) : x(_x), y(_y) {}
     bool operator < (const Tree &a)const {
         return y < a.y;
     }
 }tree[maxn];

 int main()
 {
     //freopen("input.txt", "r", stdin);
     //freopen("output.txt", "w", stdout);
     int iCase;
     scanf("%d", &iCase);
     bool flag = false;
     while (iCase--) {
         if (flag) printf("\n");
         flag = true;
         scanf("%d%d%d", &n, &c, &r);
         for (int i = ; i < n; i++) {
             scanf("%d%d", &tree[i].y, &tree[i].x);
         }
         tree[n] = Tree(, );
         tree[n + ] = Tree(r, );
         n += ;
         sort(tree, tree + n);

         int Max = , ansx = , ansy = ;
         for (int i = ; i < n; i++) {
             for (int j = i + ; j < n; j++) {
                 int lx = min(tree[i].x, tree[j].x);
                 int rx = max(tree[i].x, tree[j].x);
                 int len = rx - lx, now = ;

                 for (int k = ; k < n; k++) {
                     if (lx < tree[k].x && tree[k].x < rx) {
                         int a = tree[k].y - now < len ? tree[k].y - now : len;

                         if (a > Max) {
                             Max = a;
                             ansx = lx, ansy = now;
                         }
                         now = tree[k].y;
                     }
                 }

                 int a = c - now < len ? c - now : len;
                 if (a > Max) {
                     Max = a;
                     ansx = lx, ansy = now;
                 }
             }
         }

         printf("%d %d %d\n", ansy, ansx, Max);
     }
     return ;
 }