# Maximum-Sum Increasing Subsequence

## Description

Among all strictly increasing subsequences, find the maximum possible sum of selected values.

## Input

The verification-case input consists of an integer array `nums`, its length, and a writable DP buffer.

## Output

The function produces the maximum sum of a strictly increasing subsequence.

## Constraints

- $1 \le numsSize \le 100000$ and $1 \le nums_i \le 10000$.

## Source

Classical algorithmic problem reconstructed from the verified C artifact.