<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>& a) {
        vector<pair<int, int>> dp(a.size(), {1, 1});
        dp[0] = {1, 1};
        //    for (auto &x: a) cin >> x;
        for (int i = 1; i < dp.size(); i++) {
            for (int j = 0; j < i; j++) {
                if (a[i] > a[j] and dp[j].first + 1 > dp[i].first) {
                    dp[i].first = dp[j].first + 1;
                    dp[i].second = 0;
                }
                if ((a[i] > a[j] and dp[j].first + 1 == dp[i].first)) {
                    dp[i].second += dp[j].second;
                } 
            }
        }
        for (auto& x : dp) {
            cout << x.first << ' ' << x.second << endl;
        }
        int res = 0;
        vector<pair<int, int>> c = dp;
        std::sort(dp.begin(), dp.end());
        int maxim = dp[dp.size() - 1].first;
        for (int i = 0; i < dp.size(); i++) {
            if (dp[i].first == maxim) {
                res += dp[i].second;
            }
        }
        cout << maxim;
        return res;
    }
};
16600