Our Patreons
Diamond Sponsors
Steven & Felix Halim
Reinardus Pradhitya
Gold Sponsors
--- YOUR NAME HERE ----
Silver Sponsors
--- YOUR NAME HERE ----
Bronze Sponsors
Christianto Handojo
Krzysztof Adamek
Fatima Broom
Browse Problems
Root :: Competitive Programming: Increasing the Lower Bound of Programming Contests (Steven & Felix Halim) :: Chapter 3. Problem Solving Paradigms :: Dynamic Programming :: Longest Increasing Subsequence (LIS) - Classical
Title | Total Submissions / Solving % | Total Users / Solving % | ||||
![]() |
103 - Stacking Boxes | 46432 |
26.81%
|
12431 |
61.37%
|
|
![]() |
111 - History Grading | 36654 |
45.30%
|
13694 |
77.88%
|
|
![]() |
231 - Testing the CATCHER | 34347 |
28.50%
|
8724 |
71.57%
|
|
![]() |
481 - What Goes Up | 37478 |
27.43%
|
8195 |
74.35%
|
|
![]() |
497 - Strategic Defense Initiative | 30531 |
24.34%
|
5854 |
73.52%
|
|
![]() |
10051 - Tower of Cubes | 10022 |
37.70%
|
2754 |
83.99%
|
|
![]() |
10534 - Wavio Sequence | 23623 |
40.19%
|
4719 |
84.55%
|
|
![]() |
11003 - Boxes | 10187 |
33.80%
|
2427 |
80.96%
|
|
![]() |
11456 - Trainsorting | 17586 |
33.25%
|
4239 |
82.00%
|
|
![]() |
11790 - Murcia's Skyline | 11323 |
44.91%
|
3315 |
94.27%
|
<< Start < Prev 1 Next > End >> | ||
Display # | Results 1 - 10 of 10 |