1047. Simple Calculations

最新推荐文章于 2014-10-05 20:25:49 发布

e_qing

最新推荐文章于 2014-10-05 20:25:49 发布

阅读量531

点赞数

分类专栏： Timus 文章标签： c each

本文链接：https://blog.csdn.net/jie_qing/article/details/7607754

版权

Timus 专栏收录该内容

25 篇文章 1 订阅

订阅专栏

1047. Simple Calculations

Time Limit: 1.0 second
Memory Limit: 16 MB

There is a sequence of N + 2 elements a ₀, a ₁, …, a _N+1 (1 ≤ N ≤ 3000, −2000 ≤ a _i ≤ 2000). 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 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

Output a ₁ in the same format as a ₀ and a _N+1.

Sample

input	output
1 50.50 25.50 10.15	27.85

根据原式可以得

a[n+1]-a[n]=a[n]-a[n-1]+2*c[n]①

设S[n]=c[1]+c[2]+…+c[n]

对①式叠加相消可以得到a[n+1]-a[1]=a[n]-a[0]+2*S[n]

整理得a[n+1]-a[n]=a[1]-a[0]+2*S[n]②

对②式叠加相消可得到a[n+1]-a[1]=n*(a[1]-a[0])+2*(S[1]+S[2]+…+S[n])

#include <iostream>
using namespace std;

int main()
{
	int i, n;
	double a_0, a_n1, a_1, c[3000], s = 0, temp = 0;
	cin>>n>>a_0>>a_n1;
	for (i=0; i<n; i++)
		cin>>c[i];
	for (i=0; i<n; i++)
	{
		temp += c[i];
		s += temp;
	}
	a_1 = (a_n1 + n * a_0 - 2 * s) / (n + 1);
	printf("%.2f\n", a_1);
}