Maximum Score in Balanced String

Given a string $s$ consisting of parentheses, you need to find the maximum score possible in a balanced substring of $s.$ The score of a substring is

calculated by choosing two indices i and $s[i]j-$iss$=(())3-0+2-1=42-0+3-1=4$ Please use java and provide a better solution than O$($n$^2)$ thank you so much!!