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 | 46442 |
26.81%
|
12435 |
61.38%
|
|
|
111 - History Grading | 36657 |
45.30%
|
13695 |
77.88%
|
|
|
|
231 - Testing the CATCHER | 34347 |
28.50%
|
8724 |
71.57%
|
|
|
|
481 - What Goes Up | 37482 |
27.43%
|
8196 |
74.34%
|
|
|
|
497 - Strategic Defense Initiative | 30532 |
24.34%
|
5855 |
73.53%
|
|
|
|
10051 - Tower of Cubes | 10036 |
37.71%
|
2754 |
83.99%
|
|
|
|
10534 - Wavio Sequence | 23641 |
40.20%
|
4727 |
84.54%
|
|
|
|
11003 - Boxes | 10190 |
33.79%
|
2427 |
80.96%
|
|
|
|
11456 - Trainsorting | 17588 |
33.25%
|
4240 |
81.98%
|
|
|
|
11790 - Murcia's Skyline | 11323 |
44.91%
|
3315 |
94.27%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |