Dp[i][j] denotes the number of segment such that their range starts with the ith node and they cover exactly j nodes including ith node.
Base case:dp[i][1]=1 for all node i(as only 1 segment exists(represented by the node itself))
Recurrence:
Dp[i][j]=sum(dp[k][j-1]) where k is the next node that we can take after we take the ith node(in segment tree of n=5,for node representing range (1,3) we can have k as node representing (4,4))
U’ll see there are atmost logN possible values of k
