#include<iostream>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<fstream>
#include<algorithm>
#include<string>
#include<stack>
#include<queue>
#include<map>
typedef long long LL;
#define PI 3.1415926;
const int MAX=0xfffffff;
using namespace std;
class node {
public:
int x,y;
}vex[1010];
node stackk[1010];
double dis(node a,node b)
{
return sqrt((a.x-b.x)*(a.x-b.x)*1.0+(a.y-b.y)*(a.y-b.y));
}
int cross(node a,node b,node c) //a有向面积性质,实际是向量的叉乘
{
return (b.x-a.x)*(c.y-a.y)-(c.x-a.x)*(b.y-a.y);
}
bool cmp1(node a,node b)
{
if(a.y==b.y)
return a.x<b.x;
else
return a.y<b.y;
}
bool cmp2(node a,node b)
{
int m=cross(vex[0],a,b);
if(m==0)
return dis(vex[0],a)-dis(vex[0],b)<=0?true:false; //保留距离近的
else
return m>0?true:false;
}
int main( )
{
//freopen("1.txt","r",stdin);
int n;
double l;
while(cin>>n>>l)
{
for(int i=0;i<n;i++)
cin>>vex[i].x>>vex[i].y;
sort(vex,vex+n,cmp1);
sort(vex+1,vex+n,cmp2);
memset(stackk,0,sizeof(stackk));
stackk[0]=vex[0];
stackk[1]=vex[1];
int top=1;
for(int i=2;i<n;i++)
{
while(cross(stackk[top-1],stackk[top],vex[i])<0)
top--;
stackk[++top]=vex[i];
}
double ans=0;
for(int i=1;i<=top;i++)
ans+=dis(stackk[i],stackk[i-1]);
ans+=dis(stackk[0],stackk[top]);
ans+=2*l*PI;
printf("%.d\n",int(ans+0.5)); //四舍五入的技巧。如果改为printf("%.0lf\n",ans);错误
}
return 0;
#include<cmath>
#include<cstring>
#include<cstdio>
#include<fstream>
#include<algorithm>
#include<string>
#include<stack>
#include<queue>
#include<map>
typedef long long LL;
#define PI 3.1415926;
const int MAX=0xfffffff;
using namespace std;
class node {
public:
int x,y;
}vex[1010];
node stackk[1010];
double dis(node a,node b)
{
return sqrt((a.x-b.x)*(a.x-b.x)*1.0+(a.y-b.y)*(a.y-b.y));
}
int cross(node a,node b,node c) //a有向面积性质,实际是向量的叉乘
{
return (b.x-a.x)*(c.y-a.y)-(c.x-a.x)*(b.y-a.y);
}
bool cmp1(node a,node b)
{
if(a.y==b.y)
return a.x<b.x;
else
return a.y<b.y;
}
bool cmp2(node a,node b)
{
int m=cross(vex[0],a,b);
if(m==0)
return dis(vex[0],a)-dis(vex[0],b)<=0?true:false; //保留距离近的
else
return m>0?true:false;
}
int main( )
{
//freopen("1.txt","r",stdin);
int n;
double l;
while(cin>>n>>l)
{
for(int i=0;i<n;i++)
cin>>vex[i].x>>vex[i].y;
sort(vex,vex+n,cmp1);
sort(vex+1,vex+n,cmp2);
memset(stackk,0,sizeof(stackk));
stackk[0]=vex[0];
stackk[1]=vex[1];
int top=1;
for(int i=2;i<n;i++)
{
while(cross(stackk[top-1],stackk[top],vex[i])<0)
top--;
stackk[++top]=vex[i];
}
double ans=0;
for(int i=1;i<=top;i++)
ans+=dis(stackk[i],stackk[i-1]);
ans+=dis(stackk[0],stackk[top]);
ans+=2*l*PI;
printf("%.d\n",int(ans+0.5)); //四舍五入的技巧。如果改为printf("%.0lf\n",ans);错误
}
return 0;
}
有不懂得可以加QQ和我讨论.526664687