TZOJ 1471:Wall

描述

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.

输入

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.

输出

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.

 

这道题是一个经典的凸包问题，详见代码注释

#include<bits/stdc++.h>
using namespace std;
#define x first
#define y second
typedef pair<double,double>PII;
const int N=3010;
const double pi=acos(-1.0);
int n;
int st[N],top;//单调栈，用于存储属于凸包的点
PII a[N];
double res,l;
bool vis[N];
double dist(PII a,PII b)
{
    return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
}//两点距离
double cross(PII a,PII b)
{
    return a.x*b.y-a.y*b.x;
}//计算叉乘
double check(PII a,PII b,PII c)
{
    double t=cross({a.x-b.x,a.y-b.y},{a.x-c.x,a.y-c.y});
    if(t==0)return 0;
    else if(t>0)return 1;
    else return -1;
}//判断目前这条边相对于之前这条边的旋转方向
void solve()
{
    for(int i=1;i<=n;i++)
    {
        while(top>=2&&check(a[st[top-1]],a[st[top]],a[i])>=0)//出现凹角，则栈顶这个点不属于凸包
        {
            if(check(a[st[top-1]],a[st[top]],a[i])>0)vis[st[top]]=true;//不属于上半部分凸包，标记一下，下面判断下半部分凸包只需看标记过的点
            top--;
        }
        st[++top]=i;
    }
    vis[1]=true;
    for(int i=n;i>=1;i--)//倒着遍历一遍来判断下半部分凸包
    {
        if(!vis[i])continue;
        while(top>=2&&check(a[st[top-1]],a[st[top]],a[i])>=0)
        {
            top--;
        }
        st[++top]=i;
    }

    res=pi*2*l;//有距离限制，总长度要加上一个圆的周长
    for(int i=2;i<=top;i++)
    {
        res+=dist(a[st[i]],a[st[i-1]]);
    }
}
int main()
{
    cin>>n>>l;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i].x>>a[i].y;
    }
    sort(a+1,a+1+n);//排序，排序后的a[1]和a[n]必定是属于凸包上的点
    solve();
    printf("%.0lf",res);
    return 0;
}