##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
LIS with divisibility
Find the largest subset where every pair has or . Sort and apply LIS-like DP. Sort the array.
For each element, extend from any previous element that divides it. Example: → sorted: . DP: . Subset: . observation: if the array is sorted and , then any element in the chain with also divides . Transitivity holds.
