Hi guys, i have this problem. In a given array a length n, how many consecutive subsequence are there that satisfies: max_element — min_element of the subsequence is even. 1 <= n <= 1e5. I can't figure out a better solution than O(n^2) solution. How to solve this problem? Thanks!
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 170 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 160 |
| 5 | djm03178 | 158 |
| 5 | -is-this-fft- | 158 |
| 7 | adamant | 155 |
| 8 | Dominater069 | 154 |
| 9 | awoo | 152 |
| 9 | luogu_official | 152 |
→ Find user
→ Recent actions
About counting the number of subsequence (consecutive)
Revision en1, by National_Wind, 2020-12-01 19:10:38
History
Revisions
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
National_Wind | 2020-12-02 17:02:59 | 94 | ||
| en1 |
|
National_Wind | 2020-12-01 19:10:38 | 345 | Initial revision (published) |
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Dec/25/2024 20:19:05 (g1).
Desktop version, switch to mobile version.
Supported by
