<p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>

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

<pre>
<strong>Input:</strong> nums = [4,6,7,7]
<strong>Output:</strong> [[4,6],[4,6,7],[4,6,7,7],[4,7],[4,7,7],[6,7],[6,7,7],[7,7]]
</pre>

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

<pre>
<strong>Input:</strong> nums = [4,4,3,2,1]
<strong>Output:</strong> [[4,4]]
</pre>

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

<ul>
	<li><code>1 &lt;= nums.length &lt;= 15</code></li>
	<li><code>-100 &lt;= nums[i] &lt;= 100</code></li>
</ul>

class Solution {
public:
    map<vector<int>,int> m;
    void solve(vector<vector<int>> &ans,vector<int> v,vector<int>& nums,int i,int prev){
        if(v.size() >= 2){
            if(m.find(v)==m.end()){
                m[v]++;
                ans.push_back(v);
            }
        }
        if(i>=nums.size()){
            return;
        }
        //inc
        if(prev == -1 or nums[i] >= nums[prev]){
            v.push_back(nums[i]);
            solve(ans,v,nums,i+1,i);
            v.pop_back();
        }
        //exc
        solve(ans,v,nums,i+1,prev);
    }
    vector<vector<int>> findSubsequences(vector<int>& nums) {
        vector<vector<int>> ans;
        vector<int> v;

        solve(ans,v,nums,0,-1);
        return ans;
    }
};
100440