1359. Count All Valid Pickup and Delivery Options

对于我来说，找到正确的dp公式，还是挺有难度的。

dp[n] = n*dp[n-1]+(n*n-n)*(dp[n-1]+(n-1)*C[2n-3, 2],*...C[3,2])

class Solution {
public:
    
    int func(long n, long mod){
        long res = (n*n-n)*(n-1);
        for(long i=3;i<=2*n-3;i=i+2){
            res = res*i*(i-1)/2;
            res = res%mod;
        }
        return res;
    }
    
    int countOrders(int n) {
        long mod = 1e9+7;
        vector<long> dp(510, 0);
        dp[1] = 1;
        for(int i=2;i<=n;i++){
            dp[i] = ((i*i*dp[i-1])%mod + func(long(i), mod)%mod)%mod;
            cout<<dp[i]<<endl;
        }
        return dp[n];
    }
};

答案采用插入的方法解决，思路上很简单，但是我确实没往这个地方想，还是有差距啊。

Assume we have already n - 1 pairs, now we need to insert the nth pair.
To insert the first element, there are n * 2 - 1 chioces of position。
To insert the second element, there are n * 2 chioces of position。
So there are (n * 2 - 1) * n * 2 permutations.
Considering that delivery(i) is always after of pickup(i), we need to divide 2.
So it's (n * 2 - 1) * n.