Hello Codeforces :) It's again me!
Please help me with this problem -> link
# | User | Rating |
---|---|---|
1 | tourist | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 155 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
10 | djm03178 | 152 |
Hello Codeforces :) It's again me!
Please help me with this problem -> link
Name |
---|
dp[l][r] = string with minimal size that contains s[l...r] as subsequence.
dp[l][r] = min{ dp[l][i] + dp[i + 1][r] | l <= i < r }
dp[l][r] = min(dp[l][r], s[l] + dp[l + 1][r — 1] + s[r]) if s[l] = '(' and s[r] = ')' (or '[', ']')
Plus means concatination, min means string with mininal length.
Can you share the code??
I can't write code.
I can, but I will not. I you really want to get the idea, you must implement it by yourself.