| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3898 |
| 2 | tourist | 3840 |
| 3 | orzdevinwang | 3706 |
| 4 | ksun48 | 3691 |
| 5 | jqdai0815 | 3682 |
| 6 | ecnerwala | 3525 |
| 7 | gamegame | 3477 |
| 8 | Benq | 3468 |
| 9 | Ormlis | 3381 |
| 10 | maroonrk | 3379 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 168 |
| 2 | -is-this-fft- | 165 |
| 3 | Dominater069 | 161 |
| 4 | Um_nik | 160 |
| 5 | atcoder_official | 159 |
| 6 | djm03178 | 157 |
| 7 | adamant | 153 |
| 8 | luogu_official | 150 |
| 9 | awoo | 149 |
| 10 | TheScrasse | 146 |
A question about Longest Non-decreasing Sequence
I'm recently thinking of a problem. Given a sequence $$$a$$$, find the value of
Unable to parse markup [type=CF_MATHJAX]
. WhereUnable to parse markup [type=CF_MATHJAX]
the longest non-decreasing sequence of $$$a$$$ and $$$n$$$ is the length of $$$a$$$. $$$n$$$ is large to $$$10^5$$$ and $$$a_i$$$ is extremely small, only $$$20$$$? I can't think of a solution. Can anyone help me? Please.
