ZOJ1007.Numerical Summation of a Series

http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=7

Numerical Summation of a Series

---

Time Limit: 10 Seconds       Memory Limit: 32768 KB       Special Judge

---

Produce a table of the values of the series

Equation 1

for the 2001 values of x, x= 0.000, 0.001, 0.002, ..., 2.000. All entries of the table must have an absolute error less than 0.5e-12 (12 digits of precision). This problem is based on a problem from Hamming (1962), when mainframes were very slow by today's microcomputer standards.

Input

This problem has no input.

Output

The output is to be formatted as two columns with the values of x and y(x) printed as in the C printf or the Pascal writeln.

printf("%5.3f %16.12f\n", x, psix )		writeln(x:5:3, psix:16:12)

As an example, here are 4 acceptable lines out of 2001.

0.000   1.644934066848
...
0.500   1.227411277760
...
1.000   1.000000000000
...
2.000   0.750000000000

The values of x should start at 0.000 and increase by 0.001 until the line with x=2.000 is output.

Hint

The problem with summing the sequence in equation 1 is that too many terms may be required to complete the summation in the given time. Additionally, if enough terms were to be summed, roundoff would render any typical double precision computation useless for the desired precision.

To improve the convergence of the summation process note that

Equation 2

which implies y(1)=1.0. One can then produce a series for y(x) - y(1) which converges faster than the original series. This series not only converges much faster, it also reduces roundoff loss.

This process of finding a faster converging series may be repeated to produce sequences which converge more and more rapidly than the previous ones.

The following inequality is helpful in determining how may items are required in summing the series above.

Equation 3

 

题意：给出公式 f(x) = sigma( k(k+x)^-1)  //k = 1..inf.  求出f(0.000), f(0.001), f(0.002), ... , f(2.000)这2001个值..

大致思路：打表不能^^k，其实后面的Hint已经说给我们听怎么做了。。f(x) - f(1) = sigma((1-x) / (k * ( k+1 ) * (k+x))),,用这条公式算收敛得会比较快..根据第三条公式知，f(x)-f(1) < sigma(k^-3)<int^1(x^-3dx) = -0.5x^-2...所以k取1到1e6，后面的可以忽略不计..不过因为1e6会超是.我就取1到5e5。还一个优化就是若x>=1, f(x) = f(x-1)*(x-1)/x+x^-2...

#include <map>
#include <cmath>
#include <queue>
#include <vector>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;

#define MAXN 500000
#define eps (1e-8)
#define INF 1000000000
#define abs(x) ( (x) > 0? (x): -(x) )
#define sqr(x) ((x) * (x))
#define MAX(a, b) ((a) > (b)? (a): (b))
#define MIN(a, b) ((a) < (b)? (a): (b))

typedef long long LL;

double psix[3000];

template <typename T> void myswap( T &x, T &y ) { T temp = x; x = y; y = temp; }

int main()
{
    double ans = 0;
    for ( int j = 0; j <= 2000; ++j )
    {
        double x = j / 1000.0;
        if ( j < 1000 )
        {
            ans = 0;
            for ( int i = 1; i < MAXN; ++i )
                ans += ( 1 - x ) / ( ( i + x ) * i * ( i + 1 ) );
                /*
                 * 上面的公式改成 ans += ( 1 - x ) / ( i + x ) / i / ( i + 1 )；会慢很多，因为除法比乘法慢。
                 */
            ans = ans + 1;
        }
        else
            ans = psix[j - 1000] * ( ( x - 1 ) / x ) + 1.0 / sqr(x);
        printf( "%5.3lf %16.12lf\n", x, ans );
        psix[j] = ans;
    }
    return 0;
}

P.S.  图片上传有问题，本人比较懒，建议还是上去zoj看原题。