UVALive 6925 Volume of Revolution（数学题）

最新推荐文章于 2016-08-16 20:59:55 发布

TaoSama

最新推荐文章于 2016-08-16 20:59:55 发布

阅读量794

点赞数

分类专栏：数学文章标签：数学题

本文链接：https://blog.csdn.net/lwt36/article/details/50244355

版权

数学专栏收录该内容

18 篇文章 0 订阅

订阅专栏

题意:

$给定一个不超过5次的方程, 由此产生一个旋转体, 求其真实体积$
$与此同时给出一种估算方法, 通过给定slices横曲线和stacks竖曲线的个数, 其中横曲线有一条是可以看作是原方程$

分析:

$旋转体体积公式V=\int_a^bPI*f(x)^2dx$
$trueValue = V, 但是如何计算估算值approximateValue呢$
$观察最后一幅图的最左边, 我们发现由2个stacks竖曲线夹着的切面是一个正N棱台(N=slices)$
$V_{正棱台}=\frac{1}{3} *h*(S_{上底面}+S_{下底面}+\sqrt{S_{上底面}*S_{下底面}})$
$对于两个底面, 可以由slices的个数切成slices个等腰三角形, 我们可以算出腰长y=f(x)$
$根据S_{三角形}=\frac{1}{2}*a*b*sin(\theta)即可求出面积$
$至此问题解决$

代码:

//
//  Created by TaoSama on 2015-12-09
//  Copyright (c) 2015 TaoSama. All rights reserved.
//
//#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <set>
#include <vector>

using namespace std;
#define pr(x) cout << #x << " = " << x << "  "
#define prln(x) cout << #x << " = " << x << endl
const int N = 1e5 + 10, INF = 0x3f3f3f3f, MOD = 1e9 + 7;
const double PI = acos(-1);

int n;
double p[6], q[12]; //f(x), f(x)^2 coefficients
int a, b, slices, stacks;

double f(double *p, int n, double x) {
    double ret = 0;
    for(int i = n; ~i; --i)
        ret = ret * x + p[i];
    return ret;
}

double getArea(double x) {
    double y = f(p, n, x), theta = 2 * PI / slices;
    double triangleArea = y * y * sin(theta) / 2;
    return triangleArea * slices;
}

int main() {
#ifdef LOCAL
    freopen("C:\\Users\\TaoSama\\Desktop\\in.txt", "r", stdin);
//  freopen("C:\\Users\\TaoSama\\Desktop\\out.txt","w",stdout);
#endif
    ios_base::sync_with_stdio(0);

    int t; scanf("%d", &t);
    int kase = 0;
    while(t--) {
        scanf("%d", &n);
        for(int i = n; ~i; --i) scanf("%lf", p + i);
        scanf("%d%d%d%d", &a, &b, &slices, &stacks);

        //calculate f(x)^2 coefficients
        memset(q, 0, sizeof q);
        for(int i = 0; i <= n; ++i)
            for(int j = 0; j <= n; ++j)
                q[i + j] += p[i] * p[j];  //index for powers

        //integral, calculate f(x)^2 original function's coefficients
        for(int i = n * 2 + 1; i; --i)
            q[i] = q[i - 1] / i;
        q[0] = 0; //definite integral with no constants

        double trueValue = PI * (f(q, n * 2 + 1, b) - f(q, n * 2 + 1, a));
        double apprValue = 0;
        double x = a, dx = 1.0 * (b - a) / stacks;
        for(int i = 1; i <= stacks; ++i, x += dx) {
            double up = getArea(x), down = getArea(x + dx);
            apprValue += (up + down + sqrt(up * down)) * dx / 3;
        }
        double ans = 100 * (trueValue - apprValue) / trueValue;
        pr(apprValue); prln(trueValue);
        printf("Case %d: %.4f\n", ++kase, abs(ans));
    }
    return 0;
}