HDU 4709 Herding

原创 2015年07月09日 17:51:40

Herding

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2037    Accepted Submission(s): 580


Problem Description
Little John is herding his father's cattles. As a lazy boy, he cannot tolerate chasing the cattles all the time to avoid unnecessary omission. Luckily, he notice that there were N trees in the meadow numbered from 1 to N, and calculated their cartesian coordinates (Xi, Yi). To herding his cattles safely, the easiest way is to connect some of the trees (with different numbers, of course) with fences, and the close region they formed would be herding area. Little John wants the area of this region to be as small as possible, and it could not be zero, of course.
 

Input
The first line contains the number of test cases T( T<=25 ). Following lines are the scenarios of each test case.
The first line of each test case contains one integer N( 1<=N<=100 ). The following N lines describe the coordinates of the trees. Each of these lines will contain two float numbers Xi and Yi( -1000<=Xi, Yi<=1000 ) representing the coordinates of the corresponding tree. The coordinates of the trees will not coincide with each other.
 

Output
For each test case, please output one number rounded to 2 digits after the decimal point representing the area of the smallest region. Or output "Impossible"(without quotations), if it do not exists such a region.
 

Sample Input
1 4 -1.00 0.00 0.00 -3.00 2.00 0.00 2.00 2.00
 

Sample Output
2.00
 

Source
 

题意:

一些点,求最小围成的不为零的面积。

代码:

#include <cstdio>
#include <cmath>
#include <iostream>
#include <cstring>
using namespace std;

struct tree
{
    double x, y;
} T[110];
double area(double x0, double y0, double x1, double y1, double x2, double y2)
{
    return fabs(x0 * y1 + x1 * y2 + x2 * y0 - x1 * y0 - x2 * y1 - x0 * y2) / 2;
}
int main()
{
    int t, n;
    scanf("%d", &t);
    while(t--)
    {
        scanf("%d", &n);
        for(int i = 0; i < n; i++) scanf("%lf%lf", &T[i].x, &T[i].y);
        double Dmax = 999999999.0;
        for(int i = 0; i < n; i++)      //枚举求最小面积
        {
            for(int j = i + 1; j < n; j++)
            {
                for(int k = j + 1; k < n; k++)
                {
                    double Area = area(T[i].x, T[i].y, T[j].x, T[j].y, T[k].x, T[k].y);
                    if(Area) Dmax = min(Dmax, Area);    //将面积为0的舍去
                }
            }
        }
        if(Dmax != 999999999.0) printf("%.2lf\n", Dmax);
        else printf("Impossible\n");
    }
    return 0;
}

附:用海伦公式水了一发,WA,可能是精度问题。如有大神有正解,望不吝赐教!




版权声明:本文为博主原创文章,未经博主允许不得转载。

HDU - 4709 Herding

Description Little John is herding his father's cattles. As a lazy boy, he cannot tolerate chasin...
  • u011345136
  • u011345136
  • 2014年07月05日 14:29
  • 764

HDU 4709:Herding

Herding Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total ...
  • qq_28954601
  • qq_28954601
  • 2016年05月01日 19:53
  • 331

hdu 4709 Herding acm

Herding Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Su...
  • u011676717
  • u011676717
  • 2013年09月08日 18:35
  • 590

hdu 4709 Herding (数学)

///给你n个点 枚举三点求最小三角形面积 # include # include # include # include # include # include using namesp...
  • lp_opai
  • lp_opai
  • 2014年11月23日 19:32
  • 574

HDU 4709 Herding 解题报告

题意:给定平面上n个点,n 解法:面积最小的多边形肯定是三角形。所以n^3的枚举点就可以 //Time125MS //Memory 300K #include #include #include...
  • u010638776
  • u010638776
  • 2013年09月12日 09:39
  • 623

HDU 4709 Herding

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4709 思路:求最小的三角形面积,easy~~~~ #include #inclu...
  • huaxixidongbeishida
  • huaxixidongbeishida
  • 2013年09月09日 18:22
  • 429

hdu 4709 Herding

Herding Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total ...
  • u010228612
  • u010228612
  • 2013年09月08日 16:19
  • 1004

hdu 4709 Herding

Herding Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Sub...
  • u010422038
  • u010422038
  • 2013年09月10日 17:25
  • 823

hdu - 4709 - Herding

题意:给出N个点的坐标,从中取些点来组成一个多边形,求这个多边形的最小面积,组不成多边形的输出"Impossible"(测试组数 T 题目链接:http://acm.hdu.edu.cn/showp...
  • SCNU_Jiechao
  • SCNU_Jiechao
  • 2013年09月09日 00:13
  • 1172

HDU 4709 Herding 几何题解

求所有点组成的三角形最小的面积,0除外。 本题就枚举所有可以组成的三角形,然后保存最小的就是答案了,因为数据量很少。 复习一下如何求三角形面积。最简便的方法就是向量叉乘的知识了。 而且是二维向量...
  • kenden23
  • kenden23
  • 2014年08月15日 20:38
  • 749
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:HDU 4709 Herding
举报原因:
原因补充:

(最多只允许输入30个字)