CGL_3_A——Area（多边形面积）

Area

 

For a given polygon g, computes the area of the polygon.

g is represented by a sequence of points p1, p2,..., pn where line segments connecting pi and pi+1 (1 ≤ i≤ n−1) are sides of g. The line segment connecting pn and p1 is also a side of the polygon.

Note that the polygon is not necessarily convex.

Input

The input consists of coordinates of the points p1,..., pn in the following format:

n
x1 y1 
x2 y2
:
xn yn

The first integer n is the number of points. The coordinate of a point pi is given by two integers xi and yi. The coordinates of points are given in the order of counter-clockwise visit of them.

Output

Print the area of the polygon in a line. The area should be printed with one digit to the right of the decimal point.

Constraints

• 3 ≤ n ≤ 100
• -10000 ≤ xi, yi ≤ 10000
• No point will occur more than once.
• Two sides can intersect only at a common endpoint.

Sample Input 1

3
0 0
2 2
-1 1

Sample Output 1

2.0

 

Sample Input 2

4
0 0
1 1
1 2
0 2

Sample Output 2

1.5

题目连接：http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_A

#include<bits/stdc++.h>
using namespace std;
typedef complex<double> qua;
vector<qua> v;
double cross(qua a,qua b)
{
    return imag(b*conj(a));
}
double calc_area(vector<qua> &ve)
{
    double ans=0;
    int n=ve.size();
    for(int i=0;i<n;i++) ans+=cross(ve[i],ve[(i+1)%n]);
    return abs(ans/2.0);
}
int main()
{
    int n;
    scanf("%d",&n);
    double x,y;
    while(n--)
    {
        scanf("%lf%lf",&x,&y);
        v.push_back(qua(x,y));
    }
    printf("%.1f\n",calc_area(v));
}