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
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3947 |
| 2 | jiangly | 3734 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3612 |
| 7 | ecnerwala | 3581 |
| 8 | Geothermal | 3569 |
| 8 | cnnfls_csy | 3569 |
| 10 | ksun48 | 3479 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | awoo | 162 |
| 2 | maomao90 | 160 |
| 3 | nor | 156 |
| 3 | adamant | 156 |
| 5 | -is-this-fft- | 155 |
| 5 | atcoder_official | 155 |
| 7 | maroonrk | 153 |
| 7 | cry | 153 |
| 9 | SecondThread | 147 |
| 10 | Petr | 146 |
→ Find user
→ Recent actions
Comments (0)
Write comment?
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Aug/22/2024 16:34:13 (j2).
Desktop version, switch to mobile version.
Supported by
