三角形面积的叉积公式

叉积公式

a(x1,y1),b(x2,y2),c(x3,y3);

S=0.5abs((x2-x1)(y3-y1)-(y2-y1)*(x3-x1));
例题
B - Minimal Area Gym - 101755B

#include <iostream>
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<set>
#include<string>
#include<stack>
using namespace std;
typedef long long ll ;
const int maxn = 2e5 + 10 ;

int a[maxn] , b[maxn] ;
ll s(int x,int y,int x1,int y1)
{
    return abs((ll)x*y1-(ll)x1*y);
}
int main()
{
    int n ;

    while(cin >>n)
    {
        for(int i = 0;i<n;i++)
        {
            scanf("%d %d",&a[i],&b[i]);
        }
        a[n] = a[0];
        b[n] = b[0];
        a[n+1] = a[1] ;
        b[n+1] = b[1];
        ll ans = 4e18+10 ;
        for(int i = 0;i < n; i++)
        {
            ans = min(ans,s(a[i+1]-a[i],b[i+1]-b[i],a[i+2]-a[i],b[i+2]-b[i]));
        }
        cout<<ans<<endl;
    }
    return 0;
}