Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|
Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |
有了公式就蛮简单的了。大概过程: a[0]+a[2]-2a[1]-2c[1]=0 a[1]+a[3]-2a[2]-2c[2]=0 …… a[n-1] + a[n+1] - 2a[n] - 2c[n] = 0 累加可得: a[0]+a[n+1]-a[1]-a[n]-2c[1]-2c[2]-...-2c[n]=0 根据a[n-1]+a[n+1]-2a[n]-2c[n]=0 => a[n+1]-2c[n]-a[n]=a[n]+2c[n]-a[n-1] 化简:a[0]+a[n]-a[1]-a[n-1]-2c[1]-2c[2]-...-2c[n-1]=0 同理:a[0]+a[n-1]-a[1]-a[n-2]-2c[1]-2c[2]-...-2c[n-2]=0 …… a[0]+a[2]-a[1]-a[1]-2c[1]=0 相加上面各式可得n*a[0]+a[n+1]-(n+1)*a[1]-2*n*c[1]-2*(n-1)*c[2]-...-2*c[n]=0 即a[1]=(n*a[0]+a[n+1]-2*n*c[1]-2*(n-1)*c[2]-...-2*c[n])/(n+1) 可能还有优化的空间,大牛们不要笑话我哦! Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator