```python
def sum_digits_single(x):
    """
    Divides a number x into two parts a and b (a + b = x) such that the sum of 
    their digits S(a) + S(b) is maximized.
    """
    if x < 10:
        return x

    # The sum of digits of the parts is related to the sum of digits of the original number
    # by the formula: S(a) + S(b) = S(a+b) + 9 * C, where C is the number of carries
    # in the addition a + b. To maximize S(a) + S(b), we need to maximize C.
    # A good strategy to maximize carries is to make one of the numbers, say 'a',
    # consist of as many 9s as possible.
    # We choose 'a' to be the largest number of the form 10^k - 1 that is smaller than x.
    # If x has L digits, this number is 10^(L-1) - 1.
    
    num_digits = len(str(x))
    
    # Construct 'a' as 10^(num_digits - 1) - 1.
    # For example, if x = 592 (3 digits), a = 10^2 - 1 = 99.
    a = 10**(num_digits - 1) - 1
    
    # The other part 'b' is simply x - a.
    b = x - a
    
    # Calculate the sum of digits for a and b.
    sum_a = sum(int(digit) for digit in str(a))
    sum_b = sum(int(digit) for digit in str(b))
    
    return sum_a + sum_b
```