I was trying to solve this problem . I even searched for solution but was unable to understand .Can any one explain how to solve it.
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | awoo | 158 |
4 | cry | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 152 |
10 | maroonrk | 151 |
I was trying to solve this problem . I even searched for solution but was unable to understand .Can any one explain how to solve it.
Name |
---|
Problem statement: http://www.spoj.com/problems/ADFRUITS/
The thing that you are looking for is called shortest common supersequence(or just SCS).
The length of SCS(a,b) and be computed using simple DP:
Let dp[i][j] is the length of the shortest common supersequence of a[1],...,a[i] and b[1],...,b[j].
Then there are two cases:
1) If a[i]=b[j], then dp[i][j]=1+dp[i-1][j-1].
2) If a[i]!=b[j], then dp[i][j]=1+min(dp[i-1][j],dp[i][j-1]).
Now, think how to restore the SCS after computing the dp array.
Got it....thanks again