| # | User | Rating |
|---|---|---|
| 1 | ecnerwala | 3649 |
| 2 | Benq | 3581 |
| 3 | orzdevinwang | 3570 |
| 4 | Geothermal | 3569 |
| 4 | cnnfls_csy | 3569 |
| 6 | tourist | 3565 |
| 7 | maroonrk | 3531 |
| 8 | Radewoosh | 3521 |
| 9 | Um_nik | 3482 |
| 10 | jiangly | 3468 |
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 162 |
| 4 | TheScrasse | 160 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 152 |
| 8 | orz | 146 |
| 9 | pajenegod | 145 |
| 9 | SecondThread | 145 |
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.
Arrays contain only the elements from [1,array1.length+array2.length]
| 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) |
