uva 1606 Amphiphilic Carbon Molecules

题目：https://vjudge.net/problem/UVA-1606 

这道题要想处理得很精细，技巧太强。lrj处理得真的秒

#include<iostream>
#include<algorithm>
#include<queue>
#include<cmath>
#include<math.h>
#include<string>
#include<string.h>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<set>
#include<stack>
#include<sstream>
using namespace std;

int n;
struct node {
	int x, y, color;
	double angle;
	bool operator <(node n)
	{
		return angle < n.angle;
	}
}nd1[1005], nd2[1005];

bool cross(node i, node j)
{
	return i.x*j.y - i.y*j.x >= 0;
}
int solve()
{
	if (n <= 2)
		return n;
	int ans = 0;
	for (int i = 0; i < n; i++)
	{
		int k = 0;
		for (int j = 0; j < n; j++)
		{
			if (i != j)
			{
				nd2[k].x = nd1[j].x - nd1[i].x;
				nd2[k].y = nd1[j].y - nd1[i].y;
				if (nd1[j].color)
				{
					nd2[k].x = -nd2[k].x;
					nd2[k].y = -nd2[k].y;
				}
				nd2[k].angle = atan2(nd2[k].y, nd2[k].x);
				k++;
			}
		}
		sort(nd2, nd2 + n - 1);
		int cnt = 2, l = 0, r = 0;
		while (l < k)
		{
			if (l == r)
			{
				r = (r + 1) % k;
				cnt++; 
			}
			while (r != l && cross(nd2[l], nd2[r]))
			{
					cnt++;
					r = (r + 1) % k;
				
			}	
			l++;
			cnt--;
			ans = max(ans, cnt);
		}

	}
	return ans;
}
int main()
{
	
	while (cin >> n && n)
	{
		for (int i = 0; i < n; i++)
		{
			cin >> nd1[i].x >> nd1[i].y >> nd1[i].color;
		}
		cout << solve() << endl;
	}
	return 0;
}