Problem The Number of Sub permutations

Revision en2, by PedyD, 2019-06-07 07:16:03

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

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English PedyD 2019-06-07 07:16:03 192 (published)
en1 English PedyD 2019-06-06 08:18:25 135 Initial revision (saved to drafts)