LeetCode "Largest Divisible Subset" !

Very nice DP problem. The key fact of a mutual-divisible subset: if a new number n, is divisible with the largest number m within a mutual-divisible set s, s U {n} is also a mutal-divisible subset.

class Solution {
public:
    vector<int> largestDivisibleSubset(vector<int>& nums) {
        vector<int> ret;
        int n = nums.size();
        if(n < ) return nums;

        sort(nums.begin(), nums.end());

        typedef pair<int, int> Rec; // cnt - last inx

        // init
        vector<Rec> dp(n);
        for(int i = ; i < n; i ++)
        {
            dp[i] = {, -};
        }

        //
        int max_cnt = ;
        int max_inx = ;
        for(int i = ; i < n; i ++)
        for(int j = i - ; j >= max(,max_cnt - ); j --)
        {
            if(nums[i] % nums[j] == )
            {
                int ncnt = dp[j].first + ;
                if(ncnt > dp[i].first)
                {
                    dp[i].first = ncnt;
                    dp[i].second= j;
                }
            }

            if(dp[i].first > max_cnt)
            {
                max_cnt = dp[i].first;
                max_inx = i;
            }
        }

        // Recover the numbers
        while(max_inx >= )
        {
            ret.push_back(nums[max_inx]);
            max_inx = dp[max_inx].second;
        }
        reverse(ret.begin(), ret.end());
        return ret;
    }
};