Minimum Replacements to Sort the Array

Given an integer array where you may replace any element with two positive integers summing to it, find the minimum number of such split operations needed to make the array non-decreasing. The core challenge is choosing how many parts to split each element into (while preserving sums and order) so the final sequence is non-decreasing under large constraints (n up to 1e5, values up to 1e9).