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 | 46660 |
26.97%
|
12493 |
61.50%
|
|
|
|
111 - History Grading | 36979 |
45.33%
|
13768 |
77.86%
|
|
|
|
231 - Testing the CATCHER | 34694 |
28.53%
|
8749 |
71.56%
|
|
|
|
481 - What Goes Up | 38043 |
27.59%
|
8253 |
74.31%
|
|
|
|
497 - Strategic Defense Initiative | 30993 |
24.30%
|
5876 |
73.52%
|
|
|
|
10051 - Tower of Cubes | 10207 |
37.54%
|
2790 |
83.94%
|
|
|
|
10534 - Wavio Sequence | 24344 |
40.36%
|
4804 |
84.55%
|
|
|
|
11003 - Boxes | 10356 |
33.93%
|
2436 |
80.91%
|
|
|
|
11456 - Trainsorting | 18227 |
33.13%
|
4311 |
82.16%
|
|
|
|
11790 - Murcia's Skyline | 11434 |
45.08%
|
3341 |
94.22%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |
Browse Problems 

