<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:
    vector<vector<int>> findSubsequences(vector<int>& nums) {
        
        int n=nums.size();
        vector<vector<vector<int>>> V(n,vector<vector<int>>());
        V[0].push_back({nums[0]});
        
        for(int i=1; i<n;i++){
            V[i].push_back({nums[i]});
            for(int j=i-1;j>=0;j--){
                if(nums[i]<nums[j])continue;
                for(auto v:V[j]){
                    v.push_back(nums[i]);
                    V[i].push_back(v);
                }
            }
        }
        set<vector<int>> used;
        for(auto &v:V){
            for(auto &w:v){
                if(w.size()==1){
                    continue;
                }
                used.insert(w);
            }
        }
        vector<vector<int>> ans(used.begin(),used.end());
        return ans;
    }
};
43378