poj2601(变形的等差数列求单项)

http://poj.org/problem?id=2601

Simple calculations

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 6084		Accepted: 3085

Description

There is a sequence of n+2 elements a ₀, a ₁, ..., a _n+1 (n <= 3000, -1000 <= a _i <=1000). It is known that a_i = (a_i-1 + a_i+1)/2 - c_i for each i=1, 2, ..., n.
You are given a ₀, a _n+1, c ₁, ... , c _n. Write a program which calculates a ₁.

Input

The first line of an input contains an integer n. The next two lines consist of numbers a ₀ and a _n+1 each having two digits after decimal point, and the next n lines contain numbers c _i (also with two digits after decimal point), one number per line.

Output

The output file should contain a ₁ in the same format as a ₀ and a _n+1.

Sample Input

1
50.50
25.50
10.15

Sample Output

27.85

Source

Ural State University collegiate programming contest 2000

题意： 公式a_i = (a_i-1 + a_i+1)/2 - c_i ，已知a0,an+1,和ci(i=1~~n),求a1..。。

数学题推吧。终于推出来了，这种题高中生比大学生做的快多了。。

由a_i = (a_i-1 + a_i+1)/2 - c_i

2*ai=(ai-1+ai+1)/2-2*ci;

得到：2*a1=a0+a2-2c1;

      2*a2=a1+a3-2*c2;

      2*a3=a2+a4-2*c3;

     ……………………

     ……………………

      2*an=an-1+an+1-2*cn;

左右累加得到

an+a1=an+1+a0-2*（c1+c2++++++………………cn);

得到

a1-a0=an+1-an-2(c1+c2+…………cn);

得到

a1-a0=an+1-an-2(c1+++cn);

a1-a0=an-an-1-2（c1+c2+…………cn-1）;

a1-a0=an-1-an-2-2*(c1++++++++cn-2);

左右相加得到

a1=((an+1+n*a0)-2n*(c1)+2*(n-1)*c2+++++…………2*1*cn)/（n+1）;

#include
#include
#include
using namespace std;

int main()
{
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        double a0,ak,c;
        double sum=0;
        scanf("%lf%lf",&a0,&ak);
        for(int i=n;i>=1;i--)
        {
            scanf("%lf",&c);
            sum-=2*i*c;
        }
        //sum=-sum;
        sum+=(ak+n*a0);
        printf("%.2lf\n",sum/(n+1));
    }
    return 0;
}