UVA - 1606 Amphiphilic Carbon Molecules

题意：平面上有n个点n<=1000，分为黑白两个点，用一条线分开，使得两边两个点（只能单独取黑或白）最大。

分析：这题首先肯定是用枚举，涉及到角度精确的问题，和巨人与鬼很相似。参考了作者的方法，还是orz。

 int L = 0, R = 0, cnt = 2;
    while(L < k) {
      if(R == L) { R = (R+1)%k; cnt++; } // empty interval
      while(R != L && Left(p[L], p[R])) { R = (R+1)%k; cnt++; } // stop when [L,R] spans across > 180 degrees
      cnt--;
      L++;
      ans = max(ans, cnt);
    }

这是代码中最精华的一部分。巧妙地将黑白两点的区分和分割问题用叉积解决了。想到应该不难，但是还是有些细节方面的处理。

作者完整代码：

#include<cstdio>

#include<cmath>

#include<cstring>

#include<algorithm>

using namespace std;



const int maxn = 1000 + 5;



struct Point {

  int x, y;

  double rad; // with respect to current point

  bool operator<(const Point &rhs) const {

    return rad < rhs.rad;

  }

}op[maxn], p[maxn];



int n, color[maxn];



// from O-A to O-B, is it a left turn?

bool Left(Point A, Point B) {

  return A.x * B.y - A.y * B.x >= 0;

}



int solve() {

  if(n <= 2) return 2;

  int ans = 0;



  // pivot point

  for(int i = 0; i < n; i++) {

    int k = 0;



    // the list of other point, sorted in increasing order of rad

    for(int j = 0; j < n; j++)

      if(j != i) {

        p[k].x = op[j].x - op[i].x;

        p[k].y = op[j].y - op[i].y;

        if(color[j]) { p[k].x = -p[k].x; p[k].y = -p[k].y; }

        p[k].rad = atan2(p[k].y, p[k].x);

        k++;

      }

    sort(p, p+k);



    // sweeping. cnt is the number of points whose rad is between p[L] and p[R]

    int L = 0, R = 0, cnt = 2;

    while(L < k) {

      if(R == L) { R = (R+1)%k; cnt++; } // empty interval

      while(R != L && Left(p[L], p[R])) { R = (R+1)%k; cnt++; } // stop when [L,R] spans across > 180 degrees

      cnt--;

      L++;

      ans = max(ans, cnt);

    }

  }

  return ans;

}



int main() {

  while(scanf("%d", &n) == 1 && n) {

    for(int i = 0; i < n; i++)

      scanf("%d%d%d", &op[i].x, &op[i].y, &color[i]);

    printf("%d\n", solve());

  }

  return 0;

}