HDU2086 - A1=?(数学归纳法)

【题意】

有如下方程：A _i = (A _i-1 + A _i+1)/2 - C _i (i = 1, 2, 3, .... n).
若给出A ₀, A _n+1, 和 C ₁, C ₂, .....C _n.
请编程计算A ₁ = ?

题目链接： http://acm.hdu.edu.cn/showproblem.php?pid=2086

【分析】

A[1] = (A[0]+A[2])/2-C[1];

A[2] = (A[1]+A[3])/2-C[2];

A[3] = (A[2]+A[4])/2-C[3];

......

A[N] = (A[N-1]+A[N+1])/2-C[N];

 

A[1]+A[2] = (A[0]+A[2]+A[1]+A[3])/2-(C[1]+C[2]);

2(A[1]+A[2]) = A[0]+A[2]+A[1]+A[3]-2(C[1]+C[2]);

==>A[1]+A[1] = A[0]+A[2]-2(C[1]);

==>A[1]+A[2] = A[0]+A[3]-2(C[1]+C[2]);

==>A[1]+A[3] = A[0]+A[4]-2(C[1]+C[2]+C[3]);

==>A[1]+A[4] = A[0]+A[5]-2(C[1]+C[2]+C[3]+C[4]);

......

==>A[1]+A[N] = A[0]+A[N+1]-2(C[1]+C[2]+C[3]+C[4]+...+C[N]);

-------------------------------------------------------------------------------------------------------------

左右求和：(n+1)*A[1] + (A[2]+A[3]+...A[N]) = n*A[0] + (A[2]+A[3]+...A[N]) + A[n+1] + 2*(n*C[1]+(N-1)*C[2]+...+2*C[N-1]+C[N]); 

==>(n+1)A[1] = n*A[0] + A[N+1] + 2*(n*C[1]+(N-1)*C[2]+...+2*C[N-1]+C[N]); 

==>A[1] = [n*A[0] + A[N+1] + 2*(n*C[1]+(N-1)*C[2]+...+2*C[N-1]+C[N])] / (n+1); 

【AC代码】

/*
a[1] = (n*a[0]+a[n-1]-2(n*c[1]+(n-1)*c[2]+...+c[n]))/(n+1)
*/
#include <stdio.h>
#include <string.h>

int main()
{
#ifdef SHY
	freopen("e:\\1.txt", "r", stdin);
#endif
	int n;
	while(~scanf("%d%*c", &n))
	{
	        double a, an, c, sum = 0;
		scanf("%lf%*c%lf%*c", &a, &an);
		for(int i = n; i >= 1; i--)
		{
			scanf("%lf%*c", &c);
			sum += i * c;
		}
		printf("%.2lf\n", (n * a + an - 2 * sum) / (n + 1));
	}
	return 0;
}