<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:
    set<vector<int>>ans;
    void back(vector<int>&nums,vector<int>&cur,int prv,int idx){
        if(idx==nums.size()){
            vector<int>kk=cur;
            if(cur.size()>1)ans.insert(kk);
            return;
        }
        back(nums,cur,prv,idx+1);
        if(nums[idx]>=prv){
            cur.push_back(nums[idx]);
            back(nums,cur,nums[idx],idx+1);
            cur.pop_back();
        }
    }
    vector<vector<int>> findSubsequences(vector<int>& nums) {
        vector<int>cur;
        back(nums,cur,-200,0);
        return vector<vector<int>>(ans.begin(),ans.end());
    }
};
58214