SOFF X · AIHujjatingizni AI yaratsinSovg'ani olingMahsulot tavsifi
LIS (Longest Increasing Subsequence) — berilgan son ketma-ketligidagi elementlarning qiymati ösib boruvçi tartibda joylaşgan eng uzun qism ketma-ketlikni topiş muammosi. Reja: kirish, taʼriflar, O(n^2), O(n log n), tahlil, misollar, qoʻllanish
#algoritm#o(n log n)#lis#dinamik dasturlaş#uzun ösuvçi qism
Muallif

Seller soffTasdiqlangan muallif
- Hujjatlari
- 40 420
- Sotilgan
- 30


![[Eng uzun umumiy qism satr (LCS)]](/_next/image?url=https%3A%2F%2Fd2co7bxjtnp5o.cloudfront.net%2Fmedia%2Fposter%2Fslide_1_XSgquTY.webp&w=3840&q=60)

![[Eng uzun palindromik qism satr algoritmi]](/_next/image?url=https%3A%2F%2Fd2co7bxjtnp5o.cloudfront.net%2Fmedia%2Fposter%2Fslide_1_V4oojuk.webp&w=3840&q=60)




