<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>> rs;
    void fn(vector<int>& v,int x,int pv,vector<int> k){
        //This will generate all the subsequences
        if(x==v.size()){
            if(k.size()!=1 && k.size()!=0 && find(rs.begin(),rs.end(),k)==rs.end())
            rs.push_back(k);
            return;
        }
        if(pv<=v[x]){
            k.push_back(v[x]);
            fn(v,x+1,v[x],k);
            k.pop_back();
        }
        fn(v,x+1,pv,k);
        k.pop_back();
    }
    vector<vector<int>> findSubsequences(vector<int>& nums) {
        vector<int> k;
        fn(nums,0,INT_MIN,k);
        sort(rs.begin(),rs.end());
        return rs;
    }
};
77615