Hello,
Problem The Number of Sub permutations solve by problem k-d-sequence but in that case k = 0 and d = 1 and you count number of contiguous subsegments with a minimum number of one
Problem The Number of Sub permutations
Problem The Number of Sub permutations solve by problem k-d-sequence but in that case k = 0 and d = 1 and you count number of contiguous subsegments with a minimum number of one