uva Simple calculations （数学推导）

Simple calculations

The Problem

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₁.

The Input

The first line is the number of test cases, followed by a blank line.

For each test case, the first line of an input file 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.

Each test case will be separated by a single line.

The Output

For each test case, the output file should contain a₁ in the same format as a₀ and a_n+1.

Print a blank line between the outputs for two consecutive test cases.

Sample Input

1150.5025.5010.15

Sample Output

27.85

给你a0,an+1的值，然后给你数列C，根据给的ai = (ai-1 + ai+1) / 2 - ci ,求出a1的值。

本来是变形一下式子叠加消除，也不是很方便。对于给的式子，可以变形得到ai+1=2*ai - ai-1 + 2*ci;

则ai= 2*ai-1 -ai-2 + 2*ci-1,带入上式可得ai+1= 3*ai - 2* ai-1 + 4*ci-1 + 2*ci; 依次进行下去可得

ai+1=(i+1)*a1 - i*a0 + (2*ci + 4*ci-1 + 6*ci-2 +...+ 2*i*c0) 把i变为n 变形可得

a1 = (an+1 + n*a0 - (2*cn + 4*cn-1 + .... + 2*n*c0) ) / (n+1)

#include <iostream>
#include <cstdio>
using namespace std;
double c[3010];
int main()
{
    int T;
    cin>>T;
    for(int j=1;j<=T;j++)
    {
        int n;
        cin>>n;
        double a0,an;
        cin>>a0>>an;
        double sum=0;
        for(int i=0;i<n;i++)
         {
             cin>>c[i];
             sum+=c[i]*2*(n-i);
         }
         double ans=(an+n*a0 - sum)/(n+1);
         printf("%.2lf\n",ans);
         if(j!=T)
            cout<<endl;
    }
    return 0;
}