https://www.hackerrank.com/challenges/tutzki-and-lcs/problem
I ve been trying to solve this for hours and could'nt find any understandable online solution, Can anyone explain the logic and code behind this problem.
# | 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 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 151 |
https://www.hackerrank.com/challenges/tutzki-and-lcs/problem
I ve been trying to solve this for hours and could'nt find any understandable online solution, Can anyone explain the logic and code behind this problem.
Name |
---|
You just calculate the $$$LCS$$$ as you do.
Let $$$dp1[i][j]$$$ denotes the $$$LCS$$$ of the suffix starting from $$$ith$$$ and $$$jth$$$ index of string $$$a$$$ and $$$b$$$ respectively.
And $$$dp2[i][j]$$$denotes the $$$LCS$$$ of the prefix till $$$ith$$$ and $$$jth$$$ index of string $$$a$$$ and $$$b$$$ respectively.
Now assume we are adding a character before $$$ith$$$ index of string $$$a$$$ to match it with $$$jth$$$ index of string $$$b$$$. Think of the condition for this pair of indexes to contribute to the answer.
$$$dp1[i][j+1] + dp2[i-1][j-1] == LCS$$$
If we implement that condition directly, then it will overcount. Think why is it so?
Only the different number of final $$$a$$$ string formed matters. So, there might be a possibility that you are counting the same character at an index multiple times because that character may appear at different positions in string $$$b$$$.
You can create a $$$vis[i][j]$$$ array to mark $$$1$$$ if you have placed $$$jth$$$ character at index $$$i$$$, and then count the final answer using the number of elements that are marked $$$1$$$ in the $$$vis$$$ array.
Thank you so much brother. I understood your explanation.