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 | 46617 |
26.93%
|
12492 |
61.50%
|
|
|
111 - History Grading | 36971 |
45.32%
|
13767 |
77.86%
|
|
|
|
231 - Testing the CATCHER | 34671 |
28.52%
|
8746 |
71.55%
|
|
|
|
481 - What Goes Up | 37999 |
27.57%
|
8249 |
74.31%
|
|
|
|
497 - Strategic Defense Initiative | 30963 |
24.30%
|
5876 |
73.52%
|
|
|
|
10051 - Tower of Cubes | 10203 |
37.52%
|
2788 |
83.93%
|
|
|
|
10534 - Wavio Sequence | 24322 |
40.34%
|
4800 |
84.56%
|
|
|
|
11003 - Boxes | 10347 |
33.90%
|
2436 |
80.91%
|
|
|
|
11456 - Trainsorting | 18217 |
33.12%
|
4311 |
82.16%
|
|
|
|
11790 - Murcia's Skyline | 11429 |
45.06%
|
3339 |
94.25%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |