If changing the target boundary a t = {i , ..., j } improves this score, we will make a modification.
we consider updating the end position to j in the range of j ± N , within a pre-defined window size N , and enqueue a possible update j if the average score of S for a s and a t is higher than that of a s and a t .