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 | 46504 |
26.85%
|
12454 |
61.42%
|
|
|
111 - History Grading | 36779 |
45.28%
|
13719 |
77.84%
|
|
|
|
231 - Testing the CATCHER | 34403 |
28.49%
|
8731 |
71.56%
|
|
|
|
481 - What Goes Up | 37729 |
27.50%
|
8211 |
74.31%
|
|
|
|
497 - Strategic Defense Initiative | 30727 |
24.31%
|
5864 |
73.52%
|
|
|
|
10051 - Tower of Cubes | 10064 |
37.75%
|
2757 |
83.97%
|
|
|
|
10534 - Wavio Sequence | 23850 |
40.22%
|
4750 |
84.53%
|
|
|
|
11003 - Boxes | 10332 |
33.86%
|
2433 |
80.89%
|
|
|
|
11456 - Trainsorting | 17744 |
33.32%
|
4279 |
82.08%
|
|
|
|
11790 - Murcia's Skyline | 11338 |
44.93%
|
3321 |
94.25%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |