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 | 46596 |
26.92%
|
12483 |
61.48%
|
|
|
111 - History Grading | 36940 |
45.30%
|
13752 |
77.87%
|
|
|
|
231 - Testing the CATCHER | 34558 |
28.55%
|
8742 |
71.55%
|
|
|
|
481 - What Goes Up | 37902 |
27.57%
|
8243 |
74.32%
|
|
|
|
497 - Strategic Defense Initiative | 30915 |
24.32%
|
5873 |
73.52%
|
|
|
|
10051 - Tower of Cubes | 10181 |
37.50%
|
2778 |
83.91%
|
|
|
|
10534 - Wavio Sequence | 24258 |
40.32%
|
4788 |
84.57%
|
|
|
|
11003 - Boxes | 10342 |
33.89%
|
2435 |
80.90%
|
|
|
|
11456 - Trainsorting | 18141 |
33.15%
|
4301 |
82.12%
|
|
|
|
11790 - Murcia's Skyline | 11396 |
45.02%
|
3335 |
94.24%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |