#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2e5+100;
struct P{
ll x,y;
P(ll _x=0,ll _y=0){
x=_x;y=_y;}
P operator -(P b)const{
return P(x - b.x, y - b.y);
}
ll operator ^(P b)const{
//计算叉积
return x*b.y - y*b.x;
}
}s[N],ch[N];
int top,n,m;
ll cs(P p0,P p1,P p2){
//向量p0->p1 叉乘 向量p0->p2
return (p1.x-p0.x)*(p2.y-p0.y) - (p1.y-p0.
旋转卡壳(计算凸包的宽度)
最新推荐文章于 2023-12-19 22:43:47 发布