poj 3348--Cows(凸包求面积)

链接：http://poj.org/problem?id=3348

Cows

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 6677		Accepted: 3020

Description

Your friend to the south is interested in building fences and turning plowshares into swords. In order to help with his overseas adventure, they are forced to save money on buying fence posts by using trees as fence posts wherever possible. Given the locations of some trees, you are to help farmers try to create the largest pasture that is possible. Not all the trees will need to be used.

However, because you will oversee the construction of the pasture yourself, all the farmers want to know is how many cows they can put in the pasture. It is well known that a cow needs at least 50 square metres of pasture to survive.

Input

The first line of input contains a single integer, n (1 ≤ n ≤ 10000), containing the number of trees that grow on the available land. The next n lines contain the integer coordinates of each tree given as two integers x and y separated by one space (where -1000 ≤ x, y ≤ 1000). The integer coordinates correlate exactly to distance in metres (e.g., the distance between coordinate (10; 11) and (11; 11) is one metre).

Output

You are to output a single integer value, the number of cows that can survive on the largest field you can construct using the available trees.

Sample Input

4
0 0
0 101
75 0
75 101

Sample Output

151

Source

～～～～～～～～～～～～～～～～～～～～～～～～～～～～～～～～～～～～～～～～～～～～

凸包求面积，先用Graham求出所有凸包的点，然后用叉乘积借助三角形求面积

 #include <stdio.h>
 #include <string.h>
 #include <stdlib.h>
 #include <iostream>
 #include <algorithm>
 #include <math.h>
 #define MAXX 10010

 using namespace std;

 typedef struct point
 {
     int x;
     int y;
 }point;

 double crossProduct(point a,point b,point c)
 {
     return (c.x-a.x)*(b.y-a.y)-(c.y-a.y)*(b.x-a.x);
 }

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

 point c[MAXX];
 int top;
 point stk[MAXX];

 bool cmp(point a,point b)
 {
     double len=crossProduct(c[],a,b);
     if(len == )
     {
         return dist(c[],a)<dist(c[],b);
     }
     return len < ;
 }

 void Graham(int n)
 {
     int tmp=;
     for(int i=;i<n;i++)
     {
         if((c[i].x<c[tmp].x)||((c[i].x == c[tmp].x)&&(c[i].y<c[tmp].y)))
               tmp=i;
     }
     swap(c[],c[tmp]);
     sort(c+,c+n,cmp);
     stk[]=c[];
     stk[]=c[];
     stk[]=c[];
     top=;
     for(int i=; i<n; i++)
     {
         while()
         {
             point a,b;
             a=stk[top];
             b=stk[top-];
             if(crossProduct(a,b,c[i])<=)
             {
                 top--;
             }
             else break;
         }
         stk[++top]=c[i];//printf("%d %d^^",stk[top].x,stk[top].y);
     }
 }

 double Area(int n)
 {
     if(n<)return ;
     int i;
     double ret=0.0;
     for(i=; i<n; i++)
     {
         ret+=fabs(crossProduct(stk[],stk[i-],stk[i])/2.0);//printf("%lf---",ret);
     }
     return ret;
 }

 int main()
 {
     int i,j,n,m;
     scanf("%d",&n);
     for(i=; i<n; i++)
     {
         scanf("%d%d",&c[i].x,&c[i].y);
     }
     Graham(n);//printf("%d**",top);
     double ans=Area(top+);
     printf("%d\n",(int)ans/);
     return ;
 }