UVA10014 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

1

1
50.50
25.50
10.15

Sample Output

27.85

题目的意思就是给出a0和an+1　还有c1,c2....cn。。。让你求a1。。
从公式中可以看出

a1 =  (a0 + a2 )/ 2 - c1
a2 = (a1 + a3) /2  - c2
.......
an = (an-1 + an+1) /2 -cn;

两边相加。消去相同项变得到
a1 + an = a0 + (an+1)  - 2*(c1 + c2 +......cn);
那么我们可以代入ｎ得到一系列式子
a1 + a1 = a0 + a2 - 2*c1;
a1 + a2 = a0 + a3 - 2*(c1 + c2);
a1 + a3 = a0 + a4 - 2*(c1 + c2 +c3);
.......
a1 + an = a0 + (an+1)  - 2*(c1 + c2 +......cn);

还是相加　相消。。得到
(n+1)a1 = n*a0 +an+1 + 2(c1) + 2(c1 + c2) + 2(c1 + c2 + c3) ....... +2(c1 +c2 + c3.....+cn);
其中除了a1就都是以知的了。。就可以用它来求ａ１了！！

ＡＣ代码：

#include<stdio.h>

int main () {
	double T;
	double n;
	double a0,an1;
	double c[3010]; 
	double res = 0;
	scanf("%lf",&T);
//	printf("\n");
	while (T--) {
		res = 0 ;
		scanf("%lf",&n);
		scanf("%lf%lf",&a0,&an1);
		for (int i = 0; i < n ;i++) {
			scanf("%lf",&c[i]);
			res = res + (n -i) * c[i];
		}

		res = (n * a0 / (n + 1)) + (an1 /(n + 1)) - 2 * res /(n + 1)  ;
		printf("%.2lf\n",res);
		if(T)
			printf("\n");

	}


	return 0;
}