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. | Язык | Кто | Когда | Δ | Комментарий | |
|---|---|---|---|---|---|---|
| en2 |
|
hiroshima_boy | 2019-12-23 07:58:54 | 73 | ||
| en1 |
|
hiroshima_boy | 2019-12-22 21:38:17 | 407 | Initial revision (published) |
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3690 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 163 |
| 4 | TheScrasse | 159 |
| 5 | nor | 157 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 152 |
| 8 | Petr | 146 |
| 8 | orz | 146 |
| 10 | pajenegod | 145 |
