find maximum sum in b / w inc [ ] and dec [ ]
let result = Number . MIN_VALUE ; for ( let i = 0 ; i < n ; i ++ ) { if ( result < inc [ i ] ) result = inc [ i ] ; if ( result < dec [ i ] ) result = dec [ i ] ; }