I am working on BOI 2012 Brackets. The official editorial uses DP to solve the problem, but I noticed that for any length N strings of the form (((((....(((((, the answer is C(N−2). Is there any way to generalize this observation to a solution to the problem using Catalan numbers?
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3846 |
| 2 | tourist | 3799 |
| 3 | orzdevinwang | 3706 |
| 4 | jqdai0815 | 3682 |
| 5 | ksun48 | 3590 |
| 6 | Ormlis | 3533 |
| 7 | Benq | 3468 |
| 8 | Radewoosh | 3463 |
| 9 | ecnerwala | 3451 |
| 9 | Um_nik | 3451 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 165 |
| 2 | -is-this-fft- | 160 |
| 2 | Qingyu | 160 |
| 4 | atcoder_official | 156 |
| 5 | Dominater069 | 155 |
| 6 | adamant | 154 |
| 7 | djm03178 | 151 |
| 8 | luogu_official | 149 |
| 9 | awoo | 147 |
| 10 | Um_nik | 146 |
→ Find user
→ Recent actions
Solve BOI Brackets using Catalan Numbers?
Revision en1, by whatthemomooofun1729, 2024-07-16 05:37:40
History
Revisions
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en1 |
|
whatthemomooofun1729 | 2024-07-16 05:37:40 | 416 | Initial revision (published) |
Codeforces (c) Copyright 2010-2025 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Mar/14/2025 10:39:43 (h1).
Desktop version, switch to mobile version.
Supported by
