数三角

原题地址：https://ac.nowcoder.com/acm/contest/3003/D

解题思路
单纯的计算几何题，钝角三角形的判定方法：最长边的平方大于其余两条边的平方和
注意：需要处理三个点在一条线上的特殊情况

AC代码

#include <iostream>
#include <cmath>
using namespace std;
typedef long long ll;
const int maxn = 500 + 10;
int n;
int tri[maxn][2];

void maxlen(ll *l1, ll *l2, ll *l3)
{ //返回l1最大
	if (*l2 >= *l1 && *l2 >= *l3)
	{
		ll temp = *l1;
		*l1 = *l2;
		*l2 = temp;
	}
	else if (*l3 >= *l1 && *l3 >= *l2)
	{
		ll temp = *l1;
		*l1 = *l3;
		*l3 = temp;
	}
}

ll judge()
{//一个三角形c为最长边，满足c^2>a^2+b^2 则该三角形为钝角三角形
	ll ans = 0;
	for (int i = 0; i < n - 2; i++)
	{
		for (int j = i + 1; j < n - 1; j++)
		{
			for (int k = j + 1; k < n; k++)
			{
				ll l1 = ((tri[i][0] - tri[j][0]) * (tri[i][0] - tri[j][0]) + (tri[i][1] - tri[j][1]) * (tri[i][1] - tri[j][1]));
				ll l2 = ((tri[i][0] - tri[k][0]) * (tri[i][0] - tri[k][0]) + (tri[i][1] - tri[k][1]) * (tri[i][1] - tri[k][1]));
				ll l3 = ((tri[k][0] - tri[j][0]) * (tri[k][0] - tri[j][0]) + (tri[k][1] - tri[j][1]) * (tri[k][1] - tri[j][1]));
				
				maxlen(&l1,&l2,&l3);
				if(sqrt(l1)==(sqrt(l2)+sqrt(l3))) continue;
				if(l1>(l2+l3)) ans++;
			}
		}
	}
	return ans;
}

int main()
{
	cin >> n;
	for (int i = 0; i < n; i++)
	{
		scanf("%d%d", &tri[i][0], &tri[i][1]);
	}
	cout << judge();
	return 0;
}