HDOJ 4927 Series 1

最新推荐文章于 2021-02-28 12:22:58 发布

B12040331

最新推荐文章于 2021-02-28 12:22:58 发布

阅读量857

点赞数

分类专栏： ACM 那些年我们一起做过的ACM 文章标签： 2014ACM多校训练

本文链接：https://blog.csdn.net/u010084308/article/details/38422823

版权

那些年我们一起做过的ACM 同时被 2 个专栏收录

108 篇文章 3 订阅

订阅专栏

ACM

47 篇文章 0 订阅

订阅专栏

博客探讨了HDOJ 4927题目，涉及序列的求解方法。通过观察序列模式，发现与杨辉三角的系数相关，并推导出通项公式：(-1)^(n-1-i)*C(n-1,i)*a[i]。为避免超时，使用递推公式计算组合数，并推荐使用Java处理大数问题。" 116299495,9838180,压缩感知：MP与OMP算法详解及Matlab实现,"['信号处理', '压缩感知', '算法', 'Matlab编程']

摘要由CSDN通过智能技术生成

题目：

Series 1

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)
Total Submission(s): 132 Accepted Submission(s): 34

Problem Description

Let A be an integral series {A ₁, A ₂, . . . , A _n}.

The zero-order series of A is A itself.

The first-order series of A is {B ₁, B ₂, . . . , B _n-1},where B _i = A _i+1 - A _i.

The ith-order series of A is the first-order series of its (i - 1)th-order series (2<=i<=n - 1).

Obviously, the (n - 1)th-order series of A is a single integer. Given A, figure out that integer.

Input

The input consists of several test cases. The first line of input gives the number of test cases T (T<=10).

For each test case:
The first line contains a single integer n(1<=n<=3000), which denotes the length of series A.
The second line consists of n integers, describing A ₁, A ₂, . . . , A _n. (0<=A _i<=10 ⁵)

Output

For each test case, output the required integer in a line.

Sample Input

Sample Output

传送门：点击打开链接

解题思路：

n = 1时，答案为a[0];

n = 2时，答案为a[1] - a[0];

n = 3时，答案为a[2] - 2*a[1] + a[0];

n = 4时，答案为a[3] - 3*a[2] + 3*a[1] - a[0];

n = 5时，答案为a[4] - 4*a[3] + 6*a[2] - 4*a[1] + a[0];

我们会发现，系数其实就是杨辉三角形，

我们可以推出通项公式：(-1)^(n-1-i)*C(n-1,i)a[i]

优化，如果每一项都求组合数，会超时，我们可以这么做，利用递推公式：C(n,i) = C(n, i-1) * (n-i+1) / i，求出每一个组合数;

ps：这题中间的数据会比较大，需要用大数，所以，我们选择java。

代码：

import java.io.BufferedInputStream;
import java.math.*;
import java.util.Scanner;
 
public class Main{
    public static BigInteger cnk(int n, int k){
        BigInteger fenzi = new BigInteger("1");
        BigInteger fenmu = new BigInteger("1");
        for(int i=n-k+1; i <= n; i++){
            String s = Integer.toString(i);
            BigInteger stobig = new BigInteger(s);
            fenzi = fenzi.multiply(stobig);
    }
    for(int j=1; j <= k; j++){
        String ss = Integer.toString(j);
        BigInteger stobig2 = new BigInteger(ss);
        fenmu = fenmu.multiply(stobig2);
    }
    BigInteger result = fenzi.divide(fenmu);
    return result;
    }
    
    public static void main(String args[]){
        Scanner cin = new Scanner(new BufferedInputStream(System.in));
        int n, t;
        BigInteger a, ans, b, c, d;
        t = cin.nextInt();
        while(0 != t){
            n = cin.nextInt();
            ans = BigInteger.ZERO;
            b = BigInteger.ONE;
            d = BigInteger.ONE;
            c = ans.subtract(b);
            if(0 == n%2) b = c;
            for(int i = 1; i <= n; ++i){
                a = cin.nextBigInteger();
                a = a.multiply(b);
                b = b.multiply(c);
                a = a.multiply(d);
                d = d.multiply(BigInteger.valueOf(n-i)).divide(BigInteger.valueOf(i));
                ans = ans.add(a);
        //        System.out.println(a.toString());
            }
            //BigInteger result = cnk(2, 0);
            //System.out.println(result.toString());
            System.out.println(ans.toString());
            t--;
        }
    }
}