bzoj3190: [JLOI2013]赛车 半平面交

先按速度排序，横轴是距离，纵轴是时间。维护半平面交的最右边的点。

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
#define eps 1e-8
#define maxn 11000
int getint()
{
	int f=1,x=0;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}
struct node
{
    int v,x,id;
}c[maxn],s[maxn];
bool cmp(node a,node b)
{
    if(a.v!=b.v) return a.v<b.v;
    return a.x<b.x;
}
double cp(node a,node b)
{
    return (double)(a.x-b.x)/(b.v-a.v);
}
bool judge(node a,node b,node c)
{
    return cp(a,b)>cp(a,c);
}
int n,ans[maxn];
int main()
{
    n=getint();
	for(int i=1;i<=n;i++)c[i].x=getint();
	for(int i=1;i<=n;i++)c[i].v=getint();
	for(int i=1;i<=n;i++)c[i].id=i;
    sort(c+1,c+n+1,cmp);
    int top=1;
	for(int i=2;i<=n;i++)
	{
		if(c[i].v!=c[i-1].v|| (c[i].v==c[i-1].v&&c[i].x==c[i-1].x)) top++;
		c[top]=c[i];
	}
	n=top;top=0;
	top++;s[top]=c[1];ans[1]=c[1].id;
	for(int i=2;i<=n;i++)
	{
		while(top>0&&cp(c[i],s[top])<0) top--;
		while(top>=2&&judge(s[top-1],s[top],c[i]))top--;
		top++;s[top]=c[i];ans[top]=c[i].id;
	}
	printf("%d\n",top);
	sort(ans+1,ans+top+1);
	for(int i=1;i<=top;i++)
	{
		printf("%d",ans[i]);
		if(i!=top)printf(" ");
	}
    return 0;
}