A1 = ?
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 9324 Accepted Submission(s): 5681
题目:
http://acm.hdu.edu.cn/showproblem.php?pid=2086
Problem Description
有如下方程:Ai = (Ai-1 + Ai+1)/2 - Ci (i = 1, 2, 3, …. n).
若给出A0, An+1, 和 C1, C2, …..Cn.
请编程计算A1 = ?
Input
输入包括多个测试实例。
对于每个实例,首先是一个正整数n,(n <= 3000); 然后是2个数a0, an+1.接下来的n行每行有一个数ci(i = 1, ….n);输入以文件结束符结束。
Output
对于每个测试实例,用一行输出所求得的a1(保留2位小数).
Sample Input
1
50.00
25.00
10.00
2
50.00
25.00
10.00
20.00
Sample Output
27.50
15.00
Source
2006/1/15 ACM程序设计期末考试
Recommend
lcy | We have carefully selected several similar problems for you: 2082 2080 2085 2094 2089
题解
1 思路,一看题确定推数学公式求解
2 由题意得
2(An+Cn)=An+1+An-1
设Bn=An-An-1
得Bn+1-Bn=2*Cn
….
B2-B1=2*C1
遂累加
得Bn+1-B1=2(C1+,,,+Cn)
An+1- An- A1+ A0=2(C1+…+Cn)
已知 未知 未知 已知 已知
一下解不出来啊摔!
3 只能换思路
遂自己试了几种方法未果,査了下别人的方法,借鉴一下
1) 原博主:http://blog.csdn.net/yexiaohhjk/article/details/50229533
由题意: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 <stdio.h>
#include <stdlib.h>
#include <string.h>
int main()
{
int n;
while(scanf("%d",&n)!=EOF)
{
double a0,a1,ann,c[3010];
int i,sum=0;
scanf("%lf%lf",&a0,&ann);\\ann代表An+1
for(i=1;i<=n;i++)
{
scanf("%lf",&c[i]);
sum+=c[i]*(n+1-i);
}
a1=(n*a0+ann-2*sum)/(n+1);
printf("%.2lf\n",a1);
}
return 0;
}
2)原博主:https://www.cnblogs.com/dongsheng/archive/2012/09/13/2684102.html
n=1 2A1=A0+A2-2C1
n=2 3A1=2A0+A3-4C1-2C2
n=3 4A1=3A0+A4-6C1-4C2-2C3
n=4 5A1=4A0+A5-8C1-6C2-4C3-2C4
a[1]=1/(n+1)*(a[n+1]+n*a[0]-2*c[n]-4*c[n-1]-8*c[n-2]…-pow(2,n)*c[1]);
#include<stdio.h>
int main()
{
int n,i,k;
float a[3005],c[3005];
float sum;
while(~scanf("%d",&n))
{
scanf("%f%f",&a[0],&a[n+1]);
for(i=1;i<=n;++i)
scanf("%f",&c[i]);
k=2;
sum=0;
for(i=n;i>0;--i)
{
c[i]*=k;
k+=2;
sum+=c[i];
}
printf("%.2f\n",1.0/(n+1)*(a[n+1]+n*a[0]-sum));
}
return 0;
}