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 | 45986 |
26.63%
|
12285 |
61.14%
|
|
|
111 - History Grading | 35781 |
45.53%
|
13564 |
77.83%
|
|
|
|
231 - Testing the CATCHER | 33307 |
28.36%
|
8665 |
71.48%
|
|
|
|
481 - What Goes Up | 36026 |
27.02%
|
8038 |
74.19%
|
|
|
|
497 - Strategic Defense Initiative | 29624 |
24.08%
|
5812 |
73.40%
|
|
|
|
10051 - Tower of Cubes | 9684 |
37.61%
|
2716 |
83.98%
|
|
|
|
10534 - Wavio Sequence | 21853 |
39.83%
|
4507 |
84.47%
|
|
|
|
11003 - Boxes | 9432 |
34.23%
|
2397 |
80.93%
|
|
|
|
11456 - Trainsorting | 15932 |
33.71%
|
4148 |
81.85%
|
|
|
|
11790 - Murcia's Skyline | 9825 |
45.83%
|
3227 |
94.30%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |