CH链接:https://www.contesthunter.org/contest/CMC-Day4/B
在CH上也是有题解。对于每个点(xi,yi),求出它与圆的两个切点,每个切点可以仅仅用一个数字表示,表示度数。所以每个点都转换成了两个度数(li,ri)。对于两个点i,j,它们的连线与圆没有交点当且仅当li < lj < ri < rj或lj < li < rj < ri。所以一个合法的答案满足:lans1 < lans2 < lans3…… < rans1 < rans2 < rans3……。那么对所有点(li,ri)按l排序,求r的LIS即可。注意一个合法答案中的所有点都满足lans < rans1,可以通过枚举起始点做n遍LIS解决,因为序列已经对l排序,所以每次LIS时需处理的元素是连续的。
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
int n, r, tot, ans, q[2005];
const double pi = 3.1415926, eps = 1e-7;
struct point
{
double l, r;
bool operator < (point k)
const { return l < k.l; }
}P[2005];
void Initialize ()
{
scanf ("%d %d", &n, &r);
for (int i = 1; i <= n; i++)
{
int x, y; scanf ("%d %d", &x, &y);
double theta = atan2(1.0*y,1.0*x);
double alpha = acos(1.0*r/sqrt(1.0*x*x+1.0*y*y));
P[i].l = theta - alpha, P[i].r = theta + alpha;
if (P[i].r >= pi) P[i].r -= pi*2.0, P[i].l -= pi*2.0;
if (P[i].l <= -pi) P[i].l += pi*2.0, swap(P[i].l,P[i].r);
}
sort(P+1, P+n+1);
}
int LIS (int beg)
{
q[tot=1] = beg;
for (int i = beg+1; i <= n && P[i].l <= P[beg].r; i++)
{
int l = 1, r = tot+1, mid;
while (l < r)
{
mid = l+r>>1;
if (P[q[mid]].r >= P[i].r) r = mid;
else l = mid + 1;
}
if (q[l] == beg) continue;
tot = max(tot,l), q[l] = i;
}
return tot;
}
void Soluation ()
{
ans = 0;
for (int i = 1; i <= n; i++)
ans = max(ans, LIS(i));
printf ("%d\n", ans);
}
int main ()
{
Initialize();
Soluation();
return 0;
}