hdu 1115 Lifting the Stone【多边形重心】

Lifting the Stone

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 7048 Accepted Submission(s): 2967

Problem Description

There are many secret openings in the floor which are covered by a big heavy stone. When the stone is lifted up, a special mechanism detects this and activates poisoned arrows that are shot near the opening. The only possibility is to lift the stone very slowly and carefully. The ACM team must connect a rope to the stone and then lift it using a pulley. Moreover, the stone must be lifted all at once; no side can rise before another. So it is very important to find the centre of gravity and connect the rope exactly to that point. The stone has a polygonal shape and its height is the same throughout the whole polygonal area. Your task is to find the centre of gravity for the given polygon.

Input

The input consists of T test cases. The number of them (T) is given on the first line of the input file. Each test case begins with a line containing a single integer N (3 <= N <= 1000000) indicating the number of points that form the polygon. This is followed by N lines, each containing two integers Xi and Yi (|Xi|, |Yi| <= 20000). These numbers are the coordinates of the i-th point. When we connect the points in the given order, we get a polygon. You may assume that the edges never touch each other (except the neighboring ones) and that they never cross. The area of the polygon is never zero, i.e. it cannot collapse into a single line.

Output

Print exactly one line for each test case. The line should contain exactly two numbers separated by one space. These numbers are the coordinates of the centre of gravity. Round the coordinates to the nearest number with exactly two digits after the decimal point (0.005 rounds up to 0.01). Note that the centre of gravity may be outside the polygon, if its shape is not convex. If there is such a case in the input data, print the centre anyway.

Sample Input

  
  

   
   2
4
5 0
0 5
-5 0
0 -5
4
1 1
11 1
11 11
1 11
  
  

Sample Output

  
  

   
   0.00 0.00
6.00 6.00
  
  

Source

Central Europe 1999 

重心都忘了怎么求了，大概可以算是一种带权平均值

/*
http://blog.csdn.net/liuke19950717
*/
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
const double eps=1e-5;
const int maxn=10005;
struct node
{
    double x,y;
    node friend operator + (node a,node b)
    {
        node c={a.x+b.x,a.y+b.y};
        return c;
    }
    node friend operator - (node a,node b)
    {
        node c={a.x-b.x,a.y-b.y};
        return c;
    }
}p[maxn];
double area(node a,node b)
{
    return (a.x*b.y-a.y*b.x)/2.0;
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int n;
        scanf("%d",&n);
        for(int i=0;i<n;++i)
        {
            scanf("%lf%lf",&p[i].x,&p[i].y);
        }
        double sum=0,x=0,y=0;
        for(int i=1;i<=n;++i)
        {
            double tp=area(p[i-1]-p[0],p[i%n]-p[0]);//三角形面积 
            sum+=tp;
            x+=tp*(p[0].x+p[i-1].x+p[i].x)/3.0;
            y+=tp*(p[0].y+p[i-1].y+p[i].y)/3.0;
        }
        x/=sum,y/=sum;
        printf("%.2lf %.2lf\n",x,y);
    }
    return 0;
}