递归求最长子序列长度

int funn(vector<int>&nums,int i)
{
  int max_len=1;
  if(i==nums.size()-1)
    return 1;
  
  for(int j=i+1;j<nums.size();j++)
  {
    if(nums[j]>nums[i])
      max_len=max(max_len,funn(nums,j)+1);
    cout<<max_len<<"--"<<endl;
  }

  return max_len;
}

void fd()
{
  
}

int main()
{

  vector<int >vec;
  vec.push_back(1);
  vec.push_back(5);
  vec.push_back(4);
  vec.push_back(2);
  vec.push_back(3);
  cout<<"max="<<funn(vec,0);

  return 0;
}