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
Browse Problems
Root :: Competitive Programming 2: This increases the lower bound of Programming Contests. Again (Steven & Felix Halim) :: Problem Solving Paradigms :: Dynamic Programming :: Longest Increasing Subsequence (LIS)
Title | Total Submissions / Solving % | Total Users / Solving % | ||||
111 - History Grading | 35916 |
45.57%
|
13612 |
77.86%
|
||
231 - Testing the CATCHER | 33737 |
28.43%
|
8678 |
71.50%
|
||
437 - The Tower of Babylon | 20741 |
57.68%
|
5762 |
93.20%
|
||
481 - What Goes Up | 36541 |
27.19%
|
8079 |
74.22%
|
||
497 - Strategic Defense Initiative | 29790 |
24.08%
|
5823 |
73.40%
|
||
1196 - Tiling Up Blocks | 3608 |
39.11%
|
1044 |
91.57%
|
||
10131 - Is Bigger Smarter? | 34439 |
42.03%
|
10016 |
87.32%
|
||
10534 - Wavio Sequence | 22188 |
39.99%
|
4538 |
84.51%
|
||
11456 - Trainsorting | 16482 |
33.55%
|
4170 |
81.89%
|
||
11790 - Murcia's Skyline | 10765 |
44.79%
|
3259 |
94.32%
|
<< Start < Prev 1 Next > End >> | ||
Display # | Results 1 - 10 of 10 |