Given an array, choose two contiguous non-overlapping arrays, such that all elements are strictly increasing. Return the maximum length possible for this combination.
Ex: 7 1 2 4 6 5 3 8 9 10 => ans: 7 (Choose 1 2 4 6 & 8 9 10)
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3748 |
| 2 | Benq | 3540 |
| 3 | Petr | 3470 |
| 4 | Radewoosh | 3355 |
| 5 | ecnerwala | 3347 |
| 6 | maroonrk | 3345 |
| 7 | jiangly | 3324 |
| 8 | scott_wu | 3313 |
| 9 | ainta | 3298 |
| 10 | boboniu | 3289 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | 1-gon | 200 |
| 2 | Errichto | 196 |
| 3 | rng_58 | 194 |
| 4 | SecondThread | 186 |
| 4 | awoo | 186 |
| 6 | Um_nik | 182 |
| 7 | vovuh | 179 |
| 8 | Ashishgup | 176 |
| 9 | -is-this-fft- | 173 |
| 9 | maroonrk | 173 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2021 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Mar/02/2021 22:52:35 (i1).
Desktop version, switch to mobile version.
Supported by
