UVAOJ 10112 基础题 Myacm三角形 几何计算

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1053

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

 1 /*************************************************************************
 2     > File Name: 12345.cpp
 3     > Author: acmicpcstar
 4     > Mail: acmicpcstar@gmail.com
 5     > Created Time: 2014年04月24日 星期四 11时46分18秒
 6  ************************************************************************/
 7 
 8 #include<iostream>
 9 #include<cstring>
10 #include<cstdio>
11 #include<cmath>
12 #include<algorithm>
13 using namespace std;
14 const double pi=atan(1.0)*4.0;
15 struct point
16 {int num;int x,y;}
17 pp[16];
18 struct tri
19 {int p1,p2,p3;
20  int area;
21 }
22 tt[3000];
23 ;
24 bool cmp (tri a,tri b)
25 {
26     return a.area>b.area;
27 }
28 int mianji(point p1,point p2,point p3)
29 {
30     return abs((p3.y - p1.y)*(p2.x - p1.x) - (p2.y -p1.y)*(p3.x - p1.x));
31 }
32 
33 int main()
34 {int T;
35 
36 while(cin>>T&&T!=0)
37 {int tot=0;
38 for(int i=0;i<T;i++)
39 { char ch;
40     cin>>ch>>pp[i].x>>pp[i].y;
41 pp[i].num=i;
42 }
43 
44 for(int i=0;i<T-2;i++)
45 {
46     for (int j=i+1;j<T-1;j++)
47     {
48         for(int k=j+1;k<T;k++)
49       {
50       int sum2009;
51       sum2009=mianji(pp[i],pp[j],pp[k]);
52       if(sum2009>0)
53       {
54         tt[tot].p1=i;
55         tt[tot].p2=j;
56         tt[tot].p3=k;
57         tt[tot].area=sum2009;
58         tot++;
59       }
60 
61       }
62 
63     }
64 }
65 sort(tt,tt+tot,cmp);
66 int mark;
67 for(int i=0;i<tot;i++)
68 {
69     mark=0;
70     for(int j=0;j<T;j++)
71    {
72 
73    if(j==tt[i].p1||j==tt[i].p2||j==tt[i].p3){continue;}
74    int sum1,sum2;
75    sum1=mianji(pp[j],pp[tt[i].p1],pp[tt[i].p2])+mianji(pp[j],pp[tt[i].p1],pp[tt[i].p3])+mianji(pp[j],pp[tt[i].p2],pp[tt[i].p3]);
76    sum2=tt[i].area;
77    if(sum1==sum2)
78     {
79    mark=1;
80    }
81    }
82    if(mark==0)
83    {char c1,c2,c3;
84        c1=tt[i].p1+'A';
85      c2=tt[i].p2+'A';
86       c3=tt[i].p3+'A';
87        cout<<c1<<c2<<c3<<endl;
88        break;
89    }
90 }
91 }
92 return 0;
93 }

面积是叉积乘2为了避免浮点数的计算直接用叉积。。。求2倍面积。。。如果点在三角形里面那么。点。。。和另2个点组成的3个3角形的和总的3角形1样就可以了。。。。我看网上进一步只要另1个点。。。到3顶点的距离相等也是可以用这个来算的。

转载于:https://www.cnblogs.com/acmicpcstar/p/3687108.html