<p>Given an integer array&nbsp;<code>nums</code>, return <em>the number of longest increasing subsequences.</em></p>

<p><strong>Notice</strong> that the sequence has to be <strong>strictly</strong> increasing.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,3,5,4,7]
<strong>Output:</strong> 2
<strong>Explanation:</strong> The two longest increasing subsequences are [1, 3, 4, 7] and [1, 3, 5, 7].
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [2,2,2,2,2]
<strong>Output:</strong> 5
<strong>Explanation:</strong> The length of the longest increasing subsequence is 1, and there are 5 increasing subsequences of length 1, so output 5.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 2000</code></li>
	<li><code>-10<sup>6</sup> &lt;= nums[i] &lt;= 10<sup>6</sup></code></li>
	<li>The answer is guaranteed to fit inside a 32-bit integer.</li>
</ul>

class Solution {
public:
    int findNumberOfLIS(vector<int>& nums) {
        int n = nums.size();
        int a[n],b[n];
        a[0] = 1;
        b[0] = 1;
        for(int i = 1; i < n; i++) {
            a[i] = 0;
            b[i] = 0;
        }
        int longest = 1;
        for(int i = 1; i < n; i++) {
            int mx = 0;
            for(int j = 0; j < i; j++) {
                if(nums[j] < nums[i]) mx = max(mx,a[j]);
            }
            a[i] = mx + 1;
            longest = max(longest,a[i]);
            for(int j = 0; j < i; j++) {
                if(a[j] == mx and nums[j] < nums[i]) b[i] += b[j];
            }
            b[i] = max(b[i],1);
        }
        int ans = 0;
        cout << longest << endl;
        for(int i = 0; i < n; i++) {
            cout << b[i] << ' ';
            if(a[i] == longest) ans += b[i];
        }
        return ans;
    }
};
15400