673. Number of Longest Increasing Subsequence

Given an unsorted array of integers, find the number of longest increasing subsequence.

Example 1:

Input: [1,3,5,4,7]
Output: 2
Explanation: The two longest increasing subsequence are [1, 3, 4, 7] and [1, 3, 5, 7].

Example 2:

Input: [2,2,2,2,2]
Output: 5
Explanation: The length of longest continuous increasing subsequence is 1, and there are 5 subsequences' length is 1, so output 5.

Note:Length of the given array will be not exceed 2000 and the answer is guaranteed to be fit in 32-bit signed int.

class Solution {
public:
    int findNumberOfLIS(vector<int>& nums) {
        int sz = nums.size();
        if(sz == 0) return 0;
        vector<int> dp(sz, 1);
        vector<int> cnt(sz, 1);
        int max_v = INT_MIN;
        for(int i = 0; i < sz; i++){
            for(int j = i - 1; j >= 0; j--){
                if(nums[i] > nums[j] && dp[j] + 1 > dp[i]){                    
                    dp[i] = dp[j] + 1;
                    cnt[i] = cnt[j];                    
                } else if(nums[i] > nums[j] && dp[j] + 1 == dp[i])
                    cnt[i] += cnt[j];
            }     
           max_v = max(max_v, dp[i]);
        }          
        int num = 0;
        for(int i = 0; i < sz; i++){  
            if(dp[i] == max_v)
                num += cnt[i];
        }

        return num;
    }
};