Browse Problems 
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
Contribute
Bitcoin:
1ojudgeapLUjJcnUm
ze67a4w3TJ6WnPxo
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 | 46563 |
26.89%
|
12472 |
61.45%
|
|
|
111 - History Grading | 36881 |
45.30%
|
13734 |
77.87%
|
|
|
|
231 - Testing the CATCHER | 34519 |
28.53%
|
8736 |
71.55%
|
|
|
|
481 - What Goes Up | 37845 |
27.53%
|
8225 |
74.30%
|
|
|
|
497 - Strategic Defense Initiative | 30845 |
24.32%
|
5870 |
73.53%
|
|
|
|
10051 - Tower of Cubes | 10175 |
37.50%
|
2774 |
83.96%
|
|
|
|
10534 - Wavio Sequence | 24108 |
40.29%
|
4764 |
84.55%
|
|
|
|
11003 - Boxes | 10337 |
33.88%
|
2434 |
80.90%
|
|
|
|
11456 - Trainsorting | 17946 |
33.31%
|
4291 |
82.13%
|
|
|
|
11790 - Murcia's Skyline | 11368 |
44.98%
|
3326 |
94.23%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |