Hello everyone,
I am trying to solve this problem, but I couldn't get an idea.
So, someone please give a hint/idea.
Thanks in advance.
→ Pay attention
Before contest
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
18:45:31
Register now »
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
18:45:31
Register now »
*has extra registration
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
→ Top contributors
| # | 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 | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Nov/22/2024 22:49:29 (j2).
Desktop version, switch to mobile version.
Supported by
Hint: You have 3 sequences and are asked to remove the minimum subsequence of letters to make them the same. What classical problem is this similar to?
If you are still having trouble see this link: http://www.geeksforgeeks.org/dynamic-programming-set-3-longest-increasing-subsequence/ . You can make a simple modification to that algorithm for your problem. In addition, if you don't know what longest increasing sequence and knapsack and their solutions are, look into those as well.