POJ 1228 求多边形重心

题意给出多边形的各个点  求多边形重心  
将多边形拆解成多个三角形  求解出每个三角形的面积和重心  三角形重心为（(x1+x2+x3)/3,(y1+y2+y3)/3）  面积叉积/2可得 
最后根据积分的方法可得多边形重心
#include <iostream>
#include "stdio.h"
#include "stdlib.h"
#include "string.h"
#include "math.h"
#include "algorithm"
#include <queue>
using namespace std;
#define modulo 1000000007
const double eps=1e-8;
int n;
double ansx,ansy;
struct ed {
    double x,y;
}point[1000001];
double mult(double x1,double y1,double x2,double y2,double x3,double y3)
{
    return (x1-x3)*(y2-y3)-(y1-y3)*(x2-x3);
}
int  sgn(double x)
{
    if(fabs(x)<eps) return 0;
    if(x<0) return -1;
    else return 1;
}
void calcu()
{
    double area;
    ansx=0;ansy=0;area=0;
    for(int i=1;i<n-1;i++)
    {
        double area_=mult(point[0].x,point[0].y,point[i].x,point[i].y,point[i+1].x,point[i+1].y)/2.0;
        ansx+=((point[0].x+point[i].x+point[i+1].x)*area_);
        ansy+=((point[0].y+point[i].y+point[i+1].y)*area_);
        area+=area_;
    }
    ansx/=(3*area);
    ansy/=(3*area);
}
int main(void)
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        for(int i=0;i<n;i++)
            scanf("%lf%lf",&point[i].x,&point[i].y);
        calcu();
        printf("%.2lf %.2lf\n",ansx,ansy);
    }
}