Need Help : problem — D. Alyona and Strings

Revision en2, by Lazy_Tym, 2016-10-07 20:40:48

can anyone help me to understand the solution of (http://codeforces.net/problemset/problem/682/D) problem.It's like longest common sub-sequence but there is a extra condition.I am trying to understand the recurrence relation.

Tags 3-d dp

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English Lazy_Tym 2016-10-07 20:40:48 29 Tiny change: 'lution of [Your text to link here...](http://co' -> 'lution of (http://co'
en1 English Lazy_Tym 2016-10-07 20:40:15 295 Initial revision (published)