Longest increasing subsequences in windows based on canonical antichain partition

Given a sequence π1π2…πn, a longest increasing subsequence (LIS) in a window π〈l,r〉=πlπl+1…πr is a longest subsequence σ=πi1πi2…πiT such that l≤i1