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 | 46024 |
26.65%
|
12304 |
61.18%
|
|
|
111 - History Grading | 35840 |
45.57%
|
13582 |
77.85%
|
|
|
|
231 - Testing the CATCHER | 33567 |
28.40%
|
8669 |
71.50%
|
|
|
|
481 - What Goes Up | 36374 |
27.09%
|
8055 |
74.20%
|
|
|
|
497 - Strategic Defense Initiative | 29670 |
24.08%
|
5815 |
73.38%
|
|
|
|
10051 - Tower of Cubes | 9691 |
37.62%
|
2719 |
84.00%
|
|
|
|
10534 - Wavio Sequence | 21977 |
39.89%
|
4517 |
84.48%
|
|
|
|
11003 - Boxes | 9582 |
34.27%
|
2398 |
80.94%
|
|
|
|
11456 - Trainsorting | 16251 |
33.57%
|
4162 |
81.88%
|
|
|
|
11790 - Murcia's Skyline | 10468 |
44.72%
|
3243 |
94.30%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |