POJ 2601 Simple calculations

传送门：http://poj.org/problem?id=2601

---

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

---

Input
The first line of an input 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.

---

Output
The output file should contain a₁ in the same format as a₀ and a_n+1.

---

Sample Input
1
50.50
25.50
10.15

---

Sample Output
27.85

---

一开始没读懂题意，后来仔细一看，原来就是给一个递推关系式，来求a₁

由2a_i = a_i–1 + a_i+1 – 2c_i，将i = 1，2，3，4……n带入，得：

2a₁ = a₀ + a₂ - 2c₁

2a₂ = a₁ + a₃ - 2c₂

2a₃ = a₂ + a₄ - 2c₃

…… …… ……

2a_n = a_n-1 + a_n+1 - 2c_n，

然后保留第一个式子i， 并从第一个式子往下加，又得到n个式子：

2a₁ = a₀ + a₂ - 2c₁

a₁ + a₂ = a₀ + a₃ - 2(c₁ + c₂)

a₁ + a₃ = a₀ + a₄ - 2(c₁ + c₂ + c₃)

…… …… …… ……

a₁ + a_n = a₀ + a_n+1 - 2(c₁ + c₂ + c₃ + …… + c_n)

n个式子相加，得：

(n + 1)a₁ = na₀ + a_n+1 - 2(nc₁ + (n-1)c₂ + (n-2)c₃ + …… + c_n)，便可求出答案

程序代码：

---

#include<cstdio>
#include <iostream>
#include<algorithm>
#include <string.h>
#define N 3010
using namespace std;
double a[N], c[N];
int main()
{
#ifndef ONLINE_JUDGE
    freopen("1.txt", "r", stdin);
#endif
    int n, i, j;
    double sum;
    while(~scanf("%d", &n))
    {
        sum = 0.0;
        cin >> a[0] >> a[n+1];
        sum = n * a[0] + a[n + 1];
        for (i = 0; i < n; i++)
        {
            cin >> c[i];
            sum -= 2 * (n - i) * c[i];
        }
        printf("%.2lf\n", sum/(n+1));
    }
    return 0;
}