2739: 最远点
拆环成链,因为题目给出的是凸包,所以有决策单调性,然后分治就可以了。
#include<cmath>
#include<cstdio>
const int MAXN=500005;
typedef long long LL;
int T,n,Ans[MAXN];
struct point{long long x,y;}p[MAXN];
#include<cctype>
int read(){
int ret=0;char ch=getchar();bool f=1;
for(;!isdigit(ch);ch=getchar()) f^=!(ch^'-');
for(; isdigit(ch);ch=getchar()) ret=(ret<<1)+(ret<<3)+ch-48;
return f?ret:-ret;
}
LL GetDist(point a,point b){return (a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y);}
int ID(int x){if(x>n) x-=n;return x;}
bool check(int x,int y,int z){
if(y<x||y>x+n) return 1;
if(z<x||z>x+n) return 0;
LL Dst1=GetDist(p[x],p[y]),Dst2=GetDist(p[x],p[z]);
return Dst1==Dst2?ID(y)>ID(z):Dst1<Dst2;
}
void Solve(int l,int r,int L,int R){
if(l>r) return;
int mid=(l+r)>>1,pos=0;
for(int i=L;i<=R;i++) if(check(mid,pos,i)) pos=i;
Ans[mid]=pos>n?pos-n:pos;Solve(l,mid-1,L,pos);Solve(mid+1,r,pos,R);
}
int main(){
for(T=read();T--;){
n=read();
for(int i=1;i<=n;i++) p[i+n]=p[i]=(point){read(),read()};
Solve(1,n,1,n<<1);
for(int i=1;i<=n;i++) printf("%d\n",Ans[i]);
}
return 0;
}