# Wall

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 4577    Accepted Submission(s): 1308

Problem Description
Once upon a time there was a greedy King who ordered his chief Architect to build a wall around the King's castle. The King was so greedy, that he would not listen to his Architect's proposals to build a beautiful brick wall with a perfect shape and nice tall towers. Instead, he ordered to build the wall around the whole castle using the least amount of stone and labor, but demanded that the wall should not come closer to the castle than a certain distance. If the King finds that the Architect has used more resources to build the wall than it was absolutely necessary to satisfy those requirements, then the Architect will loose his head. Moreover, he demanded Architect to introduce at once a plan of the wall listing the exact amount of resources that are needed to build the wall.
Your task is to help poor Architect to save his head, by writing a program that will find the minimum possible length of the wall that he could build around the castle to satisfy King's requirements.

The task is somewhat simplified by the fact, that the King's castle has a polygonal shape and is situated on a flat ground. The Architect has already established a Cartesian coordinate system and has precisely measured the coordinates of all castle's vertices in feet.

Input
The first line of the input file contains two integer numbers N and L separated by a space. N (3 <= N <= 1000) is the number of vertices in the King's castle, and L (1 <= L <= 1000) is the minimal number of feet that King allows for the wall to come close to the castle.

Next N lines describe coordinates of castle's vertices in a clockwise order. Each line contains two integer numbers Xi and Yi separated by a space (-10000 <= Xi, Yi <= 10000) that represent the coordinates of ith vertex. All vertices are different and the sides of the castle do not intersect anywhere except for vertices.

Output
Write to the output file the single number that represents the minimal possible length of the wall in feet that could be built around the castle to satisfy King's requirements. You must present the integer number of feet to the King, because the floating numbers are not invented yet. However, you must round the result in such a way, that it is accurate to 8 inches (1 foot is equal to 12 inches), since the King will not tolerate larger error in the estimates.

This problem contains multiple test cases!

The first line of a multiple input is an integer N, then a blank line followed by N input blocks. Each input block is in the format indicated in the problem description. There is a blank line between input blocks.

The output format consists of N output blocks. There is a blank line between output blocks.

Sample Input
1 9 100 200 400 300 400 300 300 400 300 400 400 500 400 500 200 350 200 200 200

Sample Output
1628

ac代码：
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<iostream>
#include<algorithm>
#define fab(a) (a)>0?(a):(-a)
#define LL long long
#define MAXN 55000
#define mem(x) memset(x,0,sizeof(x))
#define INF 0xfffffff
#define PI acos(-1.0)
using namespace std;
struct s
{
double x,y;
}list[MAXN];
int stack[MAXN],top;
double dis(s aa,s bb)
{
return sqrt((aa.x-bb.x)*(aa.x-bb.x)+(aa.y-bb.y)*(aa.y-bb.y));
}
int cross(s p0,s p1,s p2)
{
return (p1.x-p0.x)*(p2.y-p0.y)-(p1.y-p0.y)*(p2.x-p0.x);
}
bool cmp(s aa,s bb)
{
int num=cross(list[0],aa,bb);
if(num>0) return true;
else if(num==0&&dis(list[0],aa)<dis(list[0],bb)) return true;
else return false;
}
void graham(int n)
{
int i;
if(n==1) {top=0;stack[0]=0;}
if(n==2) {top=1;stack[0]=0;stack[1]=1;}
if(n>2)
{
for(i=0;i<2;i++)
stack[i]=i;
top=1;
for(i=2;i<n;i++)
{
while(top>0&&cross(list[stack[top-1]],list[stack[top]],list[i])<=0) top--;
top++;
stack[top]=i;
}
}
}
int main()
{
int n,r,i,t;
scanf("%d",&t);
//getchar();
while(t--)
{
scanf("%d%d",&n,&r);
s low;
scanf("%lf%lf",&list[0].x,&list[0].y);
low.x=list[0].x,low.y=list[0].y;
int k=0;
for(i=1;i<n;i++)
{
scanf("%lf%lf",&list[i].x,&list[i].y);
if(((low.y==list[i].y)&&(low.x>list[i].x))||low.y>list[i].y)
{
low.x=list[i].x;
low.y=list[i].y;
k=i;
}
}
list[k]=list[0];
list[0]=low;
sort(list+1,list+n,cmp);
graham(n);
double ans=0;
for(i=0;i<top;i++)
{
ans+=dis(list[stack[i]],list[stack[i+1]]);
}
ans+=dis(list[stack[0]],list[stack[top]]);
//printf("%lf\n",ans);
ans+=2*PI*r;
printf("%d\n",(int)(ans+0.5));
if(t)
printf("\n");
}
return 0;
}

#### hdoj 2202 最大三角形 (凸包)

2011-02-19 00:56:00

#### hdu 1348 Wall 凸包模板题

2013-09-13 19:09:48

#### hdoj Wall 1348 （凸包）

2015-11-24 21:40:59

#### hdu1348 凸包 用了kuangbin的模板.自己做的

2014-07-07 21:04:10

#### HDU 1348 Wall 标准凸包 Graham-Scan算法

2016-07-18 21:32:04

#### HDOJ（航电）题目分类大全

2017-10-08 22:13:52

#### Wall HDU1348（计算几何+凸包）

2018-06-04 08:56:04

#### hdu1348 练习凸包模板使用

2015-11-10 15:29:28

#### HDOJ 1711 (用KMP解决)

2013-10-19 16:56:41

#### POJ 1113 Wall 凸包(模板题)

2017-04-18 15:50:32