旋转卡壳题目

虽然没有特别理解，但我不想找bug了
主要用于求凸形包的最大直径

题目

要求b包的最大直径

#include <cstdio>
#include <algorithm>
#include <cmath>
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxn = 1e6 + 10;
const double pi = 3.14159265358979323846264338327950288;
int pointsx[maxn*2];//这里一定是两倍，因为后面要i+m
int pointsy[maxn*2];
double dis(int i, int j)
{
    return sqrt(1ll * (pointsx[i] - pointsx[j]) * (pointsx[i] - pointsx[j]) + 1ll * (pointsy[i] - pointsy[j]) * (pointsy[i] - pointsy[j]));
}

long long crosss(int i, int j, int k)
{
    int x = pointsx[i] - pointsx[j];
    int y = pointsy[i] - pointsy[j];
    int z = pointsx[k] - pointsx[j];
    int w = pointsy[k] - pointsy[j];
    return abs(1ll * x * w - 1ll * y * z);
}

void solve()
{
    int n, m;
    scanf("%lld", &n);
    double ans1 = 0;
    for (int i = 0; i < n; i++)
    {

        scanf("%lld%lld", &pointsx[i], &pointsy[i]);
        if (i == 0)
        {
            continue;
        }
        else
        {
            if (i == n - 1)
            {
                ans1 += dis(i, 0);
            }
            ans1 += dis(i, i - 1);
        }
    }
    scanf("%lld", &m);
    double ans2 = 0;

    for (int i = 0; i < m; i++)
    {
        scanf("%lld%lld", &pointsx[i], &pointsy[i]);
    }
    for (int i = 0; i < m; i++)
    {
        pointsx[i + m] = pointsx[i], pointsy[i + m] = pointsy[i];
    }

    for (int i = 0, j = 1; i < m; i++)
    {
        while (crosss(i, i + 1, j + 1) >= crosss(i, i + 1, j))//这里一定要等于，虽然我不知道为什么，但不加上等于就是错的
            j++;
        ans2 = max(ans2, max(dis(i, j), dis(i + 1, j)));
    }
    double ans = ans1 + 2 * pi * ans2;
    printf("%.15lf\n", ans);
}
signed main()
{
    int t;
    scanf("%lld", &t);
    for (int i = 1; i <= t; i++)
        solve();
    return 0;
}