I need help in finding **Longest Increasing Sub-sequence** within **minimum Time complexity**.
→ Pay attention
Before contest
Codeforces Round sponsored by NEAR (Div. 1 + Div. 2)
27:08:47
Register now »
Codeforces Round sponsored by NEAR (Div. 1 + Div. 2)
27:08:47
Register now »
*has extra registration
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3803 |
| 2 | jiangly | 3707 |
| 3 | Benq | 3627 |
| 4 | ecnerwala | 3584 |
| 5 | orzdevinwang | 3573 |
| 6 | Geothermal | 3569 |
| 6 | cnnfls_csy | 3569 |
| 8 | Radewoosh | 3542 |
| 9 | jqdai0815 | 3532 |
| 10 | gyh20 | 3447 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | awoo | 162 |
| 2 | maomao90 | 160 |
| 3 | adamant | 157 |
| 4 | maroonrk | 154 |
| 5 | -is-this-fft- | 149 |
| 6 | SecondThread | 148 |
| 7 | Petr | 147 |
| 7 | atcoder_official | 147 |
| 9 | TheScrasse | 145 |
| 9 | nor | 145 |
→ Find user
→ Recent actions
Longest Increasing Sub-sequence
Difference between en1 and en2,
changed 4 character(s)
History
Revisions
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
sagarsingla_ | 2019-06-26 15:16:06 | 4 | Tiny change: 'equence** with **minimum' -> 'equence** in **minimum' | |
| en1 |
|
sagarsingla_ | 2019-06-26 15:15:24 | 123 | Initial revision (published) |
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Jul/17/2024 14:26:14 (h1).
Desktop version, switch to mobile version.
Supported by
