| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 2 | maomao90 | 163 |
| 4 | atcoder_official | 161 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | nor | 153 |
| 9 | Dominater069 | 153 |
Requesting Approach behind a problem
I don't have the exact question link which directs us implement this idea but I have an abstract.
Two arrays containing distinct(unique) elements are given . We have to delete minimum number of elements from both the arrays such that a strictly increasing sequence of length 4 does not exist. Provided a Sequence is made by alternately taking elements from the arrays.
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
hiroshima_boy | 2019-12-23 07:58:54 | 73 | ||
| en1 |
|
hiroshima_boy | 2019-12-22 21:38:17 | 407 | Initial revision (published) |
