Interesting DP problem :)

Revision ru1, by DreamingBoy, 2016-12-15 13:32:36

Hi CodeForces!

You must to find longest common correct substring.

input : 
())(()
((()()
output:
()()

1 <= N <= 500

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
ru1 Russian DreamingBoy 2016-12-15 13:32:36 195 Первая редакция (опубликовано)