<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<int> t;
    vector<vector<int>> ans;
    set<vector<int>> m;
    
    void fun(vector<int>& v, int i)
    {
        int n = t.size();
        if(n > 1 && t[n - 1] < t[n - 2])
            return;
        
        if(n > 1)
            m.insert(t);
        
        if(i == v.size())
            return;
        
        fun(v, i + 1);
        
        t.push_back(v[i]);
        fun(v, i + 1);
        t.pop_back();
    }
    
    vector<vector<int>> findSubsequences(vector<int>& v) {
        fun(v, 0);
        
        for(auto i : m)
            ans.push_back(i);
        
        return ans;
    }
};
46801