tyvj 多边形统计

#include<iostream>
#include<algorithm>
#include<math.h>
#include<stdio.h>
using namespace std;

struct node
{
       double x,y;
}point[20],res[20];

bool cmp (node a,node b)
{
     return a.y<b.y||(a.y==b.y&&a.x<b.x);
}

bool ral(node p1,node p2,node p3)
{
     return (p2.x - p1.x)*(p3.y - p1.y) > (p3.x - p1.x)*(p2.y - p1.y);
}

double getl(node a,node b)
{
       return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
}

double getarea(node a,node b,node c)
{
       double al = getl(a,b);
       double bl = getl(b,c);
       double cl = getl(a,c);
       double sum = ( al + bl + cl ) / 2;
       return sqrt(sum*(sum-al)*(sum-bl)*(sum-cl));
}

int main()
{
    int n;
    scanf("%d",&n);
    for(int i = 0;i<n;i++)
    scanf("%lf%lf",&point[i].x,&point[i].y);
    sort(point,point+n,cmp);
    res[0] = point[0];
    res[1] = point[1];
    int top = 1;
    for (int i = 2;i<n;i++)
    {
        while(top && !ral(res[top],res[top - 1],point[i]))
        top--;
        res[++top] = point[i];
    }
    int len = top;
    res[++top] = point[n - 2];
    for (int i = n - 3;i>=0;i--)
    {
        while(top!=len && !ral(res[top],res[top-1],point[i]))
        top--;
        res[++top] = point[i];
    }
    double s = 0,c = 0;
    for(int i = 0;i<top;i++)
    c += getl(res[i],res[(i+1)%top]);
    if(top==2) c /= 2.0;
    else for(int i = 1;i<top-1;i++)
    s += getarea(res[0],res[i],res[i+1]);
    printf("%.2lf\n%.2lf\n",c,s);
    //system("pause");
    return 0;
}

先凸包确定顺序，再求多边形面积，和周长，当是直线时单独考虑····