Minimum number of relocation to sort array

Правка en1, от tfgs, 2023-12-29 19:50:39

Hello, from this problem I know that the minimum number of relocations to sort the array is N-(length of longest non-dec subsequence). Please, can you help me prove this result?

Теги array, proof

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский tfgs 2023-12-29 19:50:39 257 Initial revision (published)