【Codeforces】682E. Alyona and Triangles-旋转卡壳/迭代

传送门：CF682E

---

题解

找到图中面积最大的三角形，分别将三条边作为平行四边形对角线向外翻折三角形，如下图：

图片来源：cdsszjj的题解

稍微讨论一下就会发现凸包一定被这个三角形覆盖。

虽然提示了大三角形面积$\le 4S$，但想都想不到啊qwq！

于是$O(n^2)$旋转卡壳/迭代求最大三角形即可。

---

代码

代码也是贴的学长的(大雾

旋转卡壳：

#include<bits/stdc++.h>
#define ll long long
using namespace std;

const int N=5005;
struct point
{
    int x,y;
    point(){}
    point(int _x,int _y):x(_x),y(_y){}
    inline friend point operator - (const point &a,const point &b)
    {return point(a.x-b.x,a.y-b.y);}
    inline friend point operator + (const point &a,const point &b)
    {return point(a.x+b.x,a.y+b.y);}
    inline friend ll operator * (const point &a,const point &b)
    {return 1ll*a.x*b.y-1ll*a.y*b.x;}
    inline ll dis(){return 1ll*x*x+1ll*y*y;}
}p[N],A,B,C;
int n,top;
ll S;

inline bool cmp(const point &a,const point &b)
{
    ll res=(a-p[1])*(b-p[1]);
    if(res)return res>0;
    return (a-p[1]).dis()<(b-p[1]).dis();
}

inline ll area(int i,int j,int k)
{
    return abs((p[j]-p[i])*(p[k]-p[i]));
}

void graham()
{
    for(int i=2;i<=n;i++)
        if((p[i].x<p[1].x)||(p[i].x==p[1].x&&p[i].y<p[1].y))swap(p[1],p[i]);
    sort(p+2,p+n+1,cmp),top=1;
    for(int i=2;i<=n;i++)
    {
        while(top>1&&(p[top-1]-p[i])*(p[top]-p[i])<0)top--;
        p[++top]=p[i];
    }n=top;
}

int main()
{
    scanf("%d%lld",&n,&S);
    for(int i=1;i<=n;i++)scanf("%d%d",&p[i].x,&p[i].y);
    graham();
    S=0;point a,b,c;
    for(int i=1;i<=n-2;i++)
        for(int j=i+1,k=j+1;j<=n-1;j++)
        {
            while(k<=n&&area(i,j,k+1)>=area(i,j,k))k++;
            if(area(i,j,k)>S)S=area(i,j,k),a=p[i],b=p[j],c=p[k];
        }
    A=a+(b-c),B=b+(c-a),C=c+(a-b);
    printf("%d %d\n%d %d\n%d %d\n",A.x,A.y,B.x,B.y,C.x,C.y);
    return 0;
}

迭代：

#include<bits/stdc++.h>
#define ll long long
using namespace std;

const int N=5005;
struct point
{
    int x,y;
    point(){}
    point(int _x,int _y):x(_x),y(_y){}
    inline friend point operator - (const point &a,const point &b)
    {return point(a.x-b.x,a.y-b.y);}
    inline friend point operator + (const point &a,const point &b)
    {return point(a.x+b.x,a.y+b.y);}
    inline friend ll operator * (const point &a,const point &b)
    {return 1ll*a.x*b.y-1ll*a.y*b.x;}
}p[N],A,B,C;
int n,top;
ll S;

inline ll area(int i,int j,int k)
{
    return abs((p[j]-p[i])*(p[k]-p[i]));
}

int main()
{
    scanf("%d%lld",&n,&S);
    for(int i=1;i<=n;i++)scanf("%d%d",&p[i].x,&p[i].y);
    int a=1,b=2,c=3;bool bz=1;
    S=area(a,b,c);
    while(bz)
    {
        bz=0;
        for(int i=1;i<=n;i++)
        {
            ll tmp;
            tmp=area(a,b,i);
            if(tmp>S)S=tmp,c=i,bz=1;
            tmp=area(a,i,c);
            if(tmp>S)S=tmp,b=i,bz=1;
            tmp=area(i,b,c);
            if(tmp>S)S=tmp,a=i,bz=1;
        }
    }
    A=p[a]+(p[b]-p[c]),B=p[b]+(p[c]-p[a]),C=p[c]+(p[a]-p[b]);
    printf("%d %d\n%d %d\n%d %d\n",A.x,A.y,B.x,B.y,C.x,C.y);
    return 0;
}