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 | 46326 |
26.78%
|
12400 |
61.35%
|
|
|
111 - History Grading | 36234 |
45.51%
|
13665 |
77.87%
|
|
|
|
231 - Testing the CATCHER | 34054 |
28.44%
|
8710 |
71.57%
|
|
|
|
481 - What Goes Up | 37333 |
27.42%
|
8174 |
74.30%
|
|
|
|
497 - Strategic Defense Initiative | 30413 |
24.28%
|
5846 |
73.49%
|
|
|
|
10051 - Tower of Cubes | 9934 |
37.59%
|
2741 |
83.95%
|
|
|
|
10534 - Wavio Sequence | 23243 |
40.14%
|
4657 |
84.50%
|
|
|
|
11003 - Boxes | 10070 |
33.95%
|
2420 |
80.99%
|
|
|
|
11456 - Trainsorting | 17275 |
33.45%
|
4221 |
81.99%
|
|
|
|
11790 - Murcia's Skyline | 11104 |
45.05%
|
3300 |
94.27%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |