Uva 10112 Myacm Triangles

Problem B: Myacm Triangles

Source file:	triangle.{c, cpp, java, pas}
Input file:	triangle.in
Output file:	triangle.out

There has been considerable archeological work on the ancient Myacm culture. Many artifacts have been found in what have been called power fields: a fairly small area, less than 100 meters square where there are from four to fifteen tall monuments with crystals on top. Such an area is mapped out above. Most of the artifacts discovered have come from inside a triangular area between just three of the monuments, now called the power triangle. After considerable analysis archeologists agree how this triangle is selected from all the triangles with three monuments as vertices: it is the triangle with the largest possible area that does not contain any other monuments inside the triangle or on an edge of the triangle. Each field contains only one such triangle.

Archeological teams are continuing to find more power fields. They would like to automate the task of locating the power triangles in power fields. Write a program that takes the positions of the monuments in any number of power fields as input and determines the power triangle for each power field.

A useful formula: the area of a triangle with vertices (x₁,y₁), (x₂, y₂), and (x₃,y₃) is the absolute value of

0.5 × [( y₃-y₁)(x₂-x₁)- ( y₂-y₁)(x₃-x₁)].

For each power field there are several lines of data. The first line is the number of monuments: at least 4, and at most 15. For each monument there is a data line that starts with a one character label for the monument and is followed by the coordinates of the monument, which are nonnegative integers less than 100. The first label is A, and the next is B, and so on.

There is at least one such power field described. The end of input is indicated by a 0 for the number of monuments. The first sample data below corresponds to the diagram in the problem.

For each power field there is one line of output. It contains the three labels of the vertices of the power triangle, listed in increasing alphabetical order, with no spaces.

Example input:

6
A 1 0
B 4 0
C 0 3
D 1 3
E 4 4
F 0 6
4
A 0 0
B 1 0
C 99 0
D 99 99
0

Example output:

BEF
BCD

题目大意：

给你一些点叫你算出，面积最大而且内部不含其余点的三角形。

题目解析：

可以枚举出所有可能的三角形，在判断三角形内部是否含有点

题目里告诉我们面积所以首相想到面积法，设三角形abc，还有一点o 如果Sabc=Sab+Saco+Sbco

则o在三角形内部或边上否则在三角形外部

#include <stdio.h>
#include <math.h>
const int N = 20;
struct In {
	char ch;
	int x;
	int y;
};
In in[N];

double area(In p1,In p2,In p3) {
	return fabs( 0.5 * ( (p3.y - p1.y)*(p2.x - p1.x) - (p2.y - p1.y)*(p3.x - p1.x) ));
}

int main() {
	int t;
	while(scanf("%d",&t) != EOF , t) {
		getchar();
		for(int i=0;i<t;i++) {
			in[i].ch = getchar();
			scanf("%d%d",&in[i].x,&in[i].y); getchar();
		}
		double max = -0x3f3f3f;
		double sum,tmp;
		bool flag;
		int A,B,C;
		for(int i = 0; i < t; i++) {
			for(int j = i+1; j < t; j++) {
				for(int k = j+1; k < t; k++) {

					sum = area(in[i],in[j],in[k]);

					flag = true;
					for(int l = 0; l < t; l++) {
						if( l == i || l == j || l == k) //如果其中一点是三点中的任意一点，则不用考虑
							continue;
						tmp = area(in[i],in[j],in[l]) + area(in[i],in[k],in[l]) + area(in[j],in[k],in[l]);
			
						if( tmp == sum ) {
							flag = false;
							break;
						}
					}

					if(sum > max && flag) {
						max = sum;
						A = i;
						B = j;
						C = k;
					}
				}
			}
		}
		printf("%c%c%c\n",in[A].ch,in[B].ch,in[C].ch);
	}
	return 0;
}