HDU 4919 (数学推导)

题目链接：点击这里

1.当$n=2k+1$:

$$\begin{align} f(n)&=\sum_{i=1}^{n-1}i\otimes(n-i)\\ &=2\sum_{i=1}^{k}2i\otimes (n-2i)\\ &=2\sum_{i=1}^k2i\otimes(2k-2i+1)\\ &=4\sum_{i=1}^ki\otimes(k-i)+2k\\ &=4f(k)+6k \end{align}$$

2.当$n=2k$：

$$\begin{align} f(n)&=\sum_{i=1}^{n-1}i\otimes(n-i)\\ &=\sum_{i=1}^k2i\otimes (2k-2i) + \sum_{i=1}^k(2i-1)\otimes(n-2i+1) \end{align}$$

对于左边那个式子： $$\begin{align} \sum_{i=1}^k2i\otimes (2k-2i) &=2\sum_{i=1}^{k-1}i\otimes (k-i)\\ &=\sum_{i=1}^{k-1}i\otimes (k-i)\\ &=2f(k) \end{align}$$

对于右边那个式子： $$\begin{align} \sum_{i=1}^k(2i-1)\otimes(n-2i+1)&=\sum_{i=1}^{k-1}(2i+1)\otimes (n-2i-1)\\ &=\sum_{i=0}^{k-1}(2i+1)\otimes[2(k-1)-2i+1]\\ &=2\left\{\sum_{i=0}^{k-1}i\otimes (k-1-i) \right\}\\ &=4k-4+2[\sum_{i=1}^{k-2}i\otimes (k-1-i) ]\\ &=4k-4+2\sum_{i=0}^{k-2}i\otimes (k-1-i)\\ &=2f(k-1)+4k-4 \end{align}$$

加上去就是$f(n)=2f(k)+2f(k-1)+4k-4$.

import java.math.*;
import java.util.*;

public class Main {
    BigInteger x0 = BigInteger.valueOf (0);
    BigInteger x1 = BigInteger.valueOf (1);
    BigInteger x2 = BigInteger.valueOf (2);
    BigInteger x3 = BigInteger.valueOf (3);
    BigInteger x4 = BigInteger.valueOf (4);
    BigInteger x5 = BigInteger.valueOf (5);
    BigInteger x6 = BigInteger.valueOf (6);
    Map <BigInteger, BigInteger> gg = new HashMap <BigInteger, BigInteger> ();
    BigInteger dfs (BigInteger u) {
        if (gg.get (u) != null) {
            return gg.get (u);
        }
        BigInteger k = u.divide (x2);
        BigInteger mo = u.mod (x2);
        BigInteger ans;
        if (mo.compareTo (x1) == 0) {//奇数
            ans = dfs (k).multiply (x4).add (k.multiply (x6));
            gg.put (u, ans);
            return ans;
        }
        BigInteger kk = k.subtract (x1);
        ans = dfs (k).multiply (x2).add (dfs (kk).multiply (x2)).add (k.multiply (x4)).subtract (x4);
        gg.put (u, ans);
        return ans;
    }
    void solve () {
        Scanner cin = new Scanner (System.in);
        gg.put (x2, x0); gg.put (x3, x6); gg.put (x4, x4);
        while (cin.hasNext ()) {
            BigInteger n = cin.nextBigInteger ();
            n = dfs (n);
            System.out.println (n);
        }
    }
    public static void main (String[] args) {
        Main work = new Main();
        work.solve ();
    }
}