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 | 46087 |
26.69%
|
12332 |
61.23%
|
|
|
111 - History Grading | 35933 |
45.58%
|
13619 |
77.88%
|
|
|
|
231 - Testing the CATCHER | 33771 |
28.44%
|
8686 |
71.51%
|
|
|
|
481 - What Goes Up | 36600 |
27.20%
|
8086 |
74.23%
|
|
|
|
497 - Strategic Defense Initiative | 29823 |
24.11%
|
5827 |
73.42%
|
|
|
|
10051 - Tower of Cubes | 9722 |
37.67%
|
2728 |
83.94%
|
|
|
|
10534 - Wavio Sequence | 22288 |
40.08%
|
4552 |
84.51%
|
|
|
|
11003 - Boxes | 9730 |
34.32%
|
2400 |
80.96%
|
|
|
|
11456 - Trainsorting | 16537 |
33.60%
|
4175 |
81.92%
|
|
|
|
11790 - Murcia's Skyline | 10771 |
44.82%
|
3261 |
94.33%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |