UVa 10192 - Vacation

10192 - Vacation

 * http://acm.uva.es/p/v101/10192.html

Summary
This might at first seems like a Graph Theory problem, but it is actually a simple Longest Common Subsequence (Dynamic Programming) problem.

Explanation
This is a simple Longest Common Subsequence (Dynamic Programming) problem, since this is the trip that would preserve the longest order of either recommendation.

Input
abcd acdb abcd dacb

Output
Case #1: you can visit at most 3 cities. Case #2: you can visit at most 2 cities.