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 | 46533 |
26.87%
|
12458 |
61.43%
|
|
|
111 - History Grading | 36800 |
45.27%
|
13721 |
77.84%
|
|
|
|
231 - Testing the CATCHER | 34415 |
28.50%
|
8733 |
71.57%
|
|
|
|
481 - What Goes Up | 37750 |
27.49%
|
8212 |
74.32%
|
|
|
|
497 - Strategic Defense Initiative | 30751 |
24.32%
|
5866 |
73.53%
|
|
|
|
10051 - Tower of Cubes | 10066 |
37.76%
|
2759 |
83.98%
|
|
|
|
10534 - Wavio Sequence | 23915 |
40.22%
|
4756 |
84.52%
|
|
|
|
11003 - Boxes | 10335 |
33.88%
|
2433 |
80.89%
|
|
|
|
11456 - Trainsorting | 17796 |
33.28%
|
4280 |
82.08%
|
|
|
|
11790 - Murcia's Skyline | 11340 |
44.94%
|
3323 |
94.25%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 10 of 10 | |