| # Longest Nondecreasing Subsequence | |
| ## Description | |
| Find the maximum length of a subsequence whose values are nondecreasing. | |
| ## Input | |
| The verification-case input consists of an integer array `nums`, its length, and a writable `tails` buffer. | |
| ## Output | |
| The function produces the length of the longest nondecreasing subsequence. | |
| ## Constraints | |
| - $0 \le numsSize \le 100000$. | |
| ## Source | |
| Classical algorithmic problem reconstructed from the verified C artifact. | |