UVA10014 - 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

1
1
50.50
25.50
10.15

Sample Output

27.85

题解：a[i]=(a[i-1]+a[i+1])*2+c[i]   所以：a[i+1]=2*a[i]+2*c[i]-a[i-1];

#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;

struct node
{
    double  a;
    double dk;

}a[3010];

int main()
{
    int t;
    while(scanf("%d",&t)!=EOF)
{

       while(t--)
       {
            int n;
            scanf("%d",&n);
            a[0].dk=0;a[1].a=0;a[1].dk=1;
            double pp,qq;

            scanf("%lf%lf",&a[0].a,&qq);
            int i;
            for(i=1;i<=n;i++)
            {
                scanf("%lf",&pp);
                a[i+1].a=2*pp+2*a[i].a-a[i-1].a;
                a[i+1].dk=2*a[i].dk-a[i-1].dk;
            }
            printf("%.2lf\n",(qq-a[n+1].a)/a[n+1].dk);

           if(t) printf("\n");
      }


    }


    return 0;
}