HDU 1071 The area（微积分 计算几何）

原题

The area

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)

Problem Description

Ignatius bought a land last week, but he didn't know the area of the land because the land is enclosed by a parabola and a straight line. The picture below shows the area. Now given all the intersectant points shows in the picture, can you tell Ignatius the area of the land?

Note: The point P1 in the picture is the vertex of the parabola.

Input

The input contains several test cases. The first line of the input is a single integer T which is the number of test cases. T test cases follow.
Each test case contains three intersectant points which shows in the picture, they are given in the order of P1, P2, P3. Each point is described by two floating-point numbers X and Y(0.0<=X,Y<=1000.0).

Output

For each test case, you should output the area of the land, the result should be rounded to 2 decimal places.

Sample Input

2 5.000000 5.000000 0.000000 0.000000 10.000000 0.000000 10.000000 10.000000 1.000000 1.000000 14.000000 8.222222

Sample Output

33.33 40.69

题意

二维平面有一条直线与一条开口向下的抛物线相交，现在给出抛物线顶点以及两个交点，求出直线与抛物线围成的面积。

涉及知识及算法

微积分

设抛物线方程为 ,带入点(x3,y3)得 ,由两交点得到直线 ，所以直线与抛物线围成的面积  

代码

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

int main()
{
    double x1,x2,x3,y1,y2,y3;
    int t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%lf%lf%lf%lf%lf%lf",&x1,&y1,&x2,&y2,&x3,&y3);
        //pow(x,y) 计算x的y次方。x、y及函数返回值都是double型
        printf("%.2lf\n",(y1-y3)*(x3-x2)-(y1-y3)*(pow(x3-x1,3)-pow(x2-x1,3))/(3.0*pow(x3-x1,2))+(y3-y2)*(x3-x2)/2.0);
    }
    return 0;
}

文章转载自CSDN博主ZSQ，链接http://blog.csdn.net/v5zsq/article/details/48085929，表示感谢。