UVA - 10112 Myacm Triangles

题目大意：给出一些点，求构成三角形面积最大且三角形内不含别的点的三个点。

解题思路：比较面积后判断三角形内部是否有点，若内部有点则该点与三角形的三点中任意两点构成的三角形的面积相加正好等于这个三角形。

#include<iostream> 
#include<cstdio>
#include<string.h>
#include<stdlib.h>
#include<cmath>
using namespace std;
typedef struct {
    char c;
    int x, y;
}point;
point p[20];
double area(int a, int b, int c) {
    return fabs(0.5 * ((p[c].y - p[a].y) * (p[b].x - p[a].x) - (p[b].y - p[a].y) * (p[c].x - p[a].x)));
}
bool is_in(int a, int b, int c, int i) {
    double A, B, C;
    A = area(a, b, i);
    B = area(a, c, i);
    C = area(b, c, i);
    if (A + B + C == area(a, b, c)) return true;
    else return false;
}
int main() {
    int n;
    while(scanf("%d", &n) != EOF && n) {
        for (int i = 0; i < n; i++) {
            getchar();
            scanf("%c%d%d", &p[i].c, &p[i].x, &p[i].y);
        }
        char A, B, C;
        double max = 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++)
                    if (max < area(i,j,k)) {
                        int tag = 1;
                        for (int t = 0; t < n; t++) {
                            if(t == i || t == j || t == k) continue;
                            if (is_in(i, j, k, t)) { tag = 0;break; } 
                        }
                        if (tag) {
                            A = p[i].c;
                            B = p[j].c;
                            C = p[k].c;
                            max = area(i, j, k);
                        }
                    }       
        printf("%c%c%c\n",A, B, C);
    }
    return 0; 
}