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 | 46423 |
26.80%
|
12429 |
61.36%
|
|
|
111 - History Grading | 36636 |
45.30%
|
13692 |
77.88%
|
|
|
|
231 - Testing the CATCHER | 34315 |
28.49%
|
8722 |
71.57%
|
|
|
|
481 - What Goes Up | 37465 |
27.43%
|
8193 |
74.36%
|
|
|
|
497 - Strategic Defense Initiative | 30524 |
24.33%
|
5854 |
73.52%
|
|
|
|
10051 - Tower of Cubes | 9975 |
37.60%
|
2748 |
83.95%
|
|
|
|
10534 - Wavio Sequence | 23566 |
40.22%
|
4712 |
84.59%
|
|
|
|
11003 - Boxes | 10176 |
33.81%
|
2426 |
80.96%
|
|
|
|
11456 - Trainsorting | 17563 |
33.26%
|
4238 |
82.00%
|
|
|
|
11790 - Murcia's Skyline | 11322 |
44.90%
|
3315 |
94.27%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |