Description

 

Once upon a time there was a greedy King who ordered his chief Architect to build a field for royal cricket inside his park. The King was so greedy, that he would not listen to his Architect's proposals to build a field right in the park center with pleasant 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 has dared to touch even a single tree in his 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.

Your task is to help poor Architect to save his head, by writing a program that will find the maximum possible size of the cricket field and its location inside the park to satisfy King's requirements.

The task is somewhat simplified by the fact, that King's park has a rectangular shape and is situated on a flat ground. Moreover, park's borders are perfectly aligned with North-South and East-West lines. At the same time, royal cricket is always played on a square field that is also aligned with North-South and East-West lines. Architect has already established a Cartesian coordinate system and has precisely 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 (WH), 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, but may be situated on its side. The cricket field may also touch park's border, but shall not lie outside 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 NW, and H, separated by spaces. N ( 0N100) is the number of trees in the park. W and H ( 1WH10000) 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 ( 0XiW, 0YiH) 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 PQ, and L separated by spaces, where (PQ) 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.

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

Note: This is a sample input and output that corresponds to the park plan that is shown on the picture.

题意:给出一张二维图,上面有n个点,要求你找出一个最大的正方形,其中不能有点。

思路:解决这样的问题,当然是采用暴力的方法,可以这样,枚举这幅图的左区间 L 和右区间 R,如果这个区间之内没有点,那么就可以形成边长为min(R - L,h)的正方形了,如果有,那就从下至上考虑点的影响,每两个点之间就形成了上下区间,不过不要忘记最上面的点与w形成的区间和0与最下面的点形成的区间。

应该要注意到n的数据范围是100,而w,h的数据范围是10000,所以你在枚举左右区间时应该要想到绝对不可能采用h

同样的可以去考虑点对于区间选取的影响,每两个点之间形成一个区间,还要考虑最左边的和最右边的区间

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#define REP(i,n) for(int i=1;i<=n;i++)
#define M(a) memset(a,0,sizeof(a));
using namespace std;
const int maxn=+;
int n,w,h;
int idx[maxn];
struct node
{
int x,y;
bool operator < (const node & a) const
{
if(x!=a.x) return x<a.x;
return y<a.y;
}
} eve[maxn]; void Init()
{
M(idx);
scanf("%d%d%d",&n,&w,&h);
eve[].x=,eve[].y=;
idx[]=;
idx[n+]=h; //idx的初始化很重要,是枚举的基础
eve[n+].x=w;
eve[n+].y=h;//同时也必须假设(0,0)和(w,h)各有一点
REP(i,n)
{
scanf("%d%d",&eve[i].x,&eve[i].y);
idx[i]=eve[i].y;
}
} void Work()
{
int ansx=,ansy=,anslen=;
sort(eve+,eve+n+);
sort(idx+,idx+n+);
for(int i=; i<=n; i++)
for(int j=i+; j<=n+; j++)
{
int l=idx[i],r=idx[j],down=,up,ww,hh;
ww=r-l;
for(int k=; k<=n; k++)
{
if(eve[k].y>l&&eve[k].y<r)
{
hh=eve[k].x-down;
if(anslen<min(ww,hh))
{
anslen=min(ww,hh);
ansx=l;
ansy=down;
}
down=eve[k].x;
}
}
hh=w-down;
if(anslen<min(ww,hh))
{
anslen=min(hh,ww);
ansx=l;
ansy=down;
}
}
printf("%d %d %d\n",ansy,ansx,anslen);
} int main()
{
int T;
scanf("%d",&T);
while(T--)
{
Init();
Work();
if(T) puts("");
}
return ;
}

自然也可以以上下界做枚举,不过一定要清楚输入给出的是x,y坐标,你用x,y却是把它看做行与列,完全不同啊

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn=;
struct node
{
int x,y;
bool operator < (const node & a) const
{
return y<a.y;
}
} eve[maxn]; int idx[maxn]; int main()
{
int T;
cin>>T;
while(T--)
{
int n,w,h;
cin>>n>>w>>h;
eve[].x=;idx[]=;
eve[].y=;
for(int i=; i<=n; i++) {cin>>eve[i].y>>eve[i].x;idx[i]=eve[i].x;} //输入的y坐标是行,x坐标是列
eve[n+].x=h;idx[n+]=h;
eve[n+].y=w;
sort(eve+,eve+n+);
sort(idx+,idx+n+);
int maxlen=,maxx=,maxy=;
for(int i=; i<=n+; i++)
for(int j=i+; j<=n+; j++)
{
int down=idx[i],up=idx[j],l=,hi,wi;
hi=up-down;
//cout<<hi<<" "<<idx[i]<<" "<<idx[j]<<endl;
for(int k=;k<=n;k++)
{
if(eve[k].x<=down||eve[k].x>=up) continue;
wi=eve[k].y-l;
if(maxlen<min(wi,hi))
{
maxlen=min(wi,hi);
maxx=down;
maxy=l;
}
l=eve[k].y;
}
wi=w-l;
if(maxlen<min(wi,hi))
{
maxlen=min(wi,hi);
maxx=down;
maxy=l;
}
}
cout<<maxy<<" "<<maxx<<" "<<maxlen<<endl;
if(T) puts("");
}
return ;
}

E - Cricket Field的更多相关文章

  1. Codeforces Gym 100002 C "Cricket Field" 暴力

    "Cricket Field" Time Limit: 1 Sec Memory Limit: 256 MB 题目连接 http://codeforces.com/gym/1000 ...

  2. UVa 1312 Cricket Field (枚举+离散化)

    题意:在w*h的图上有n个点,要求找出一个正方形面积最大,且没有点落在该正方形内部. 析:枚举所有的y坐标,去查找最大矩形,不断更新. 代码如下: #include <cstdio> #i ...

  3. UVA 1312 Cricket Field

    题意: 在w*h的坐标上给n个点, 然后求一个最大的矩形,使得这个矩形内(不包括边界)没有点,注意边界上是可以有点的. 分析: 把坐标离散化.通过两重循环求矩形的高,然后枚举,看是否能找到对应的矩形. ...

  4. UVA-1312 Cricket Field (技巧枚举)

    题目大意:在一个w*h的网格中,有n个点,找出一个最大的正方形,使得正方形内部没有点. 题目分析:寻找正方形实质上等同于寻找矩形(只需令长宽同取较短的边长).那么枚举出所有可能的长宽组合取最优答案即可 ...

  5. 【习题 8-19 UVA-1312】Cricket Field

    [链接] 我是链接,点我呀:) [题意] 在这里输入题意 [题解] 添加两个y坐标0和h 然后从这n+2个y坐标中任选两个坐标,作为矩形的上下界. 然后看看哪些点在这个上下界中. 定义为坐标集合S S ...

  6. 【uva 1312】Cricket Field(算法效率--技巧枚举)

    题意:一个 L*R 的网格里有 N 棵树,要求找一个最大空正方形并输出其左下角坐标和长.(1≤L,R≤10000, 0≤N≤100) 解法:枚举空正方形也就是枚举空矩阵,先要固定一个边,才好继续操作. ...

  7. UVA1616-Caravan Robbers(枚举)

    Problem UVA1616-Caravan Robbers Accept: 160  Submit: 1156Time Limit: 3000 mSec Problem Description O ...

  8. WC2021 题目清单

    Day2 上午 <IOI题型与趣题分析> 来源 题目 完成情况 备注 IOI2002 Day1T1 Frog 已完成 IOI2002 Day1T2 Utopia IOI2002 Day1T ...

  9. salesforce 零基础学习(六十二)获取sObject中类型为Picklist的field values(含record type)

    本篇引用以下三个链接: http://www.tgerm.com/2012/01/recordtype-specific-picklist-values.html?m=1 https://github ...

随机推荐

  1. oracle从子表取出前几行数据:

    取排序后的前几行,应该用: select * from(select * from test order by stamp desc) where rownum<= 6  (表示排序后取前几行) ...

  2. Git分支管理策略(转)

    作者: 阮一峰 日期: 2012年7月 5日 使用"版本管理系统"(Version Control System). 眼下最流行的"版本管理系统",非Git莫属 ...

  3. vue中父组件传数据给子组件

    父组件: <template> <parent> <child :list="list"></child> //在这里绑定list对 ...

  4. bzoj 1878: [SDOI2009]HH的项链【树状数组】

    对于一个lr,每个颜色贡献的是在(1,r)区间里出现的最右位置,所以记录一个b数组表示当前点这个颜色上一个出现的位置 然后把询问离线,按r升序排序 每次把右端点右移,把这个点在树状数组上+1,并且在当 ...

  5. 数据结构之动态顺序表(C实现)

    线性表有2种,分为顺序表和链表. 顺序表: 采用顺序存储方式,在一组地址连续的存储空间上存储数据元素的线性表(长度固定) 链表: 有3种,单链表.双向链表.循环链表(长度不固定) seqList.h ...

  6. [Usaco2011 Jan]道路和航线

    Description Farmer John正在一个新的销售区域对他的牛奶销售方案进行调查.他想把牛奶送到T个城镇 (1 <= T <= 25,000),编号为1T.这些城镇之间通过R条 ...

  7. [Usaco2018 Open]Milking Order

    Description Farmer John的N头奶牛(1≤N≤10^5),仍然编号为1-N,正好闲得发慌.因此,她们发展了一个与Farmer John每天早上为她们挤牛奶的时候的排队顺序相关的复杂 ...

  8. 一个完整的mybatis项目,包含增删改查

    1.导入jar包,导入相关配置文件,均在自己博客园的文件中 编写mybatis.xml文件 <?xml version="1.0" encoding="UTF-8& ...

  9. LN : leetcode 217 Contains Duplicate

    lc 217 Contains Duplicate 217 Contains Duplicate Given an array of integers, find if the array conta ...

  10. Java编程思想读书笔记_第7章

    final关键字类似const: import java.util.*; public class FinalData { static Random rand = new Random(47); f ...