POJ 2187 旋转卡壳 解题报告
来源:互联网 发布:java两个日期相差年数 编辑:程序博客网 时间:2024/06/16 14:55
Beauty Contest
Time Limit: 3000MS Memory Limit: 65536K
Total Submissions: 37380 Accepted: 11571
Description
Bessie, Farmer John’s prize cow, has just won first place in a bovine beauty contest, earning the title ‘Miss Cow World’. As a result, Bessie will make a tour of N (2 <= N <= 50,000) farms around the world in order to spread goodwill between farmers and their cows. For simplicity, the world will be represented as a two-dimensional plane, where each farm is located at a pair of integer coordinates (x,y), each having a value in the range -10,000 … 10,000. No two farms share the same pair of coordinates.
Even though Bessie travels directly in a straight line between pairs of farms, the distance between some farms can be quite large, so she wants to bring a suitcase full of hay with her so she has enough food to eat on each leg of her journey. Since Bessie refills her suitcase at every farm she visits, she wants to determine the maximum possible distance she might need to travel so she knows the size of suitcase she must bring.Help Bessie by computing the maximum distance among all pairs of farms.
Input
Line 1: A single integer, N
Lines 2..N+1: Two space-separated integers x and y specifying coordinate of each farm
Output
- Line 1: A single integer that is the squared distance between the pair of farms that are farthest apart from each other.
Sample Input
4
0 0
0 1
1 1
1 0
Sample Output
2
【解题报告】
裸题
代码如下:
#include<cstdio>#include<cstring>#include<cmath>#include<algorithm>using namespace std;#define MAXN 50005struct Point{ int x,y; bool operator<(const Point& _P)const { return y<_P.y||(y==_P.y&&x<_P.x); };}pset[MAXN],ch[MAXN];int cross(Point a,Point b,Point o) {return (a.x-o.x)*(b.y-o.y)-(b.x-o.x)*(a.y-o.y);}int dist2(Point a,Point b){return (a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y);}void convex_hull(Point *p,Point *ch,int n,int &len){ sort(p,p+n); ch[0]=p[0]; ch[1]=p[1]; int top=1; for(int i=2;i<n;++i) { while(top>0&&cross(ch[top],p[i],ch[top-1])<=0) --top; ch[++top]=p[i]; } int tmp=top; for(int i=n-2;i>=0;--i) { while(top>tmp&&cross(ch[top],p[i],ch[top-1])<=0) --top; ch[++top]=p[i]; } len=top; }int rotating_calipers(Point *ch,int n){ int q=1,ans=0; ch[n]=ch[0]; for(int p=0;p<n;++p) { while(cross(ch[p+1],ch[q+1],ch[p])>cross(ch[p+1],ch[q],ch[p])) q=(q+1)%n; ans=max(ans,max(dist2(ch[p],ch[q]),dist2(ch[p+1],ch[q+1]))); } return ans; }int main(){ int n,len; while(scanf("%d",&n)!=EOF) { for(int i=0;i<n;++i) { scanf("%d%d",&pset[i].x,&pset[i].y); } convex_hull(pset,ch,n,len); printf("%d\n",rotating_calipers(ch,len)); } return 0;}
让我看到你们的双手
- POJ 2187 旋转卡壳 解题报告
- POJ-2187(旋转卡壳)
- poj 2187(旋转卡壳)
- poj 2187(旋转卡壳)
- BZOJ 1069 [SCOI 2007] 旋转卡壳 解题报告
- POJ 2187 旋转卡壳第一题
- Poj 2187 Beauty Contest(旋转卡壳)
- POJ 2187 凸包+旋转卡壳
- poj 2187 Beauty Contest(旋转卡壳)
- POJ 2187: Beauty Contest(旋转卡壳)
- POJ 2187 Beauty Contest(旋转卡壳)
- POJ 2187 凸包&旋转卡壳
- POJ 2187 Beauty Contest 旋转卡壳
- POJ 2187 Beauty Contest 旋转卡壳
- [POJ 2187]Beauty Contest(旋转卡壳)
- POJ 2187 Beauty Contest(旋转卡壳)
- poj 2187(凸包+旋转卡壳)
- POJ 2187 旋转卡壳求凸包的直径
- LeetCode 459. Repeated Substring Pattern
- 5.13
- [leetcode: Python]242.Valid Anagram
- jvm 垃圾收集器
- Promise相关
- POJ 2187 旋转卡壳 解题报告
- 点击小图弹出大图片且手势放大和缩放功能
- const用法
- easyui-datebox前一个选择了日期,后一个只能该日期之后的日期,或是一个周之后的日期
- ZCMU—1556
- Spring MVC中加载配置properties文件(以配置Redis为例)
- 数据结构草稿
- 信号同步
- IntelliJ中的main函数和System.out.println()快捷键