Divorce Gym - 101845D

https://cn.vjudge.net/problem/Gym-101845D 

前缀和分三角形求凸包面积（叉乘）； 

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
//#include <unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
//#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 1e18
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

template<typename T>inline void read(T &x)
{
    x=0;
    static int p;p=1;
    static char c;c=getchar();
    while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
    while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
    x*=p;
}

//-----------------------------------------------
const int maxn=1e5+9;
const int mod=1e9+7;

struct point
{
    double x,y;
}p[maxn];

double sum[maxn];
int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);

    int n,m;
    sfi(n);
    sfi(m);

    for(int i=1;i<=n;i++)
    {
        scanf("%lf%lf",&p[i].x,&p[i].y);
    }

    sum[0]=0;
    for(int i=1;i<n;i++)
    {
        sum[i]=sum[i-1]+p[i].x*p[i+1].y-p[i+1].x*p[i].y;
    }

    double area=fabs(sum[n-1]-p[1].x*p[n].y+p[n].x*p[1].y);
    area/=2.0;

    double ans=0;
    while(m--)
    {
        int x,y;
        scanf("%d%d",&x,&y);
        if(x<=y)
        {
            swap(x,y);
        }

        double tmp=sum[y-1]-sum[x-1]-p[x].x*p[y].y+p[x].y*p[y].x;
        tmp/=2.0;
        ans=max(ans,min(fabs(tmp),area-fabs(tmp)));

    }

    printf("%.12lf\n",ans);



    return 0;
}