hdu 2086 数学规律

题意：

有如下方程：Ai = (Ai-1 + Ai+1)/2 - Ci (i = 1, 2, 3, .... n).

若给出A0, An+1, 和 C1, C2, .....Cn.

请编程计算A1 = ?

题解：

       这是一道数学规律题。

因为：Ai=(Ai-1+Ai+1)/2 - Ci,  
      A1=(A0  +A2  )/2 - C1; 
      A2=(A1  +  A3)/2 - C2 , ... 
=>    A1+A2 = (A0+A2+A1+A3)/2 - (C1+C2) 
=>    A1+A2 =  A0+A3 - 2(C1+C2)  
同理可得： 
      A1+A1 =  A0+A2 - 2(C1)  
      A1+A2 =  A0+A3 - 2(C1+C2) 
      A1+A3 =  A0+A4 - 2(C1+C2+C3) 
      A1+A4 =  A0+A5 - 2(C1+C2+C3+C4) 
      ... 
      A1+An = A0+An+1 - 2(C1+C2+...+Cn) 
----------------------------------------------------- 左右求和 
     (n+1)A1+(A2+A3+...+An) = nA0 +(A2+A3+...+An) + An+1 - 2(nC1+(n-1)C2+...+2Cn-1+Cn) 
  
=>   (n+1)A1 = nA0 + An+1 - 2(nC1+(n-1)C2+...+2Cn-1+Cn) 
  
=>   A1 = [nA0 + An+1 - 2(nC1+(n-1)C2+...+2Cn-1+Cn)]/(n+1) 

代码：

      
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
const int maxn=3000+10;
double c[maxn];

int main()
{
    int n;
    double A0,An;
    while(scanf("%d",&n)!=EOF)
    {
        scanf("%lf%lf",&A0,&An);
        double sum=0.0;
        for(int i=1;i<=n;i++)
        {
            scanf("%lf",&c[i]);
            sum+=(n-i+1)*c[i];
        }
        double A1 = (n*A0+An-2*sum)/(n+1);
        printf("%.2lf\n",A1);
    }
    return 0;
}