PedyD's blog

Problem The Number of Sub permutations
By PedyD, history, 5 years ago, In English

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

  • Vote: I like it
  • +16
  • Vote: I do not like it

»
5 years ago, # |
  Vote: I like it +5 Vote: I do not like it

Auto comment: topic has been updated by PedyD (previous revision, new revision, compare).

→ Reply