<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 {
private:
        vector <vector <int>> ans;
        int n;
public:
    void helper(vector <int> &nums,int last,int begin,vector <int> &help){
        if(begin >= n){
            if(help.size() > 1){ans.push_back(help);}
            return ;
        }
            helper(nums,last,begin+1,help);
            if(nums[begin] >= last){
                help.push_back(nums[begin]);
                helper(nums,nums[begin],begin+1,help);
                help.pop_back();
            }
    }
    vector<vector<int>> findSubsequences(vector<int>& nums) {
        n = nums.size();
        vector <int> help;
        helper(nums,-200,0,help);
        sort(ans.begin(),ans.end());
        auto last = unique(ans.begin(),ans.end());
        ans.erase(last,ans.end());
        return ans;
    }
};
auto init = [](){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    return 'c';
}();
36530