UVa 10100 - Longest Match

10100 - Longest Match

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

Summary
This is a standard Dynamic Programming (Longest Common Subsequence) problem.

Explanation
Use the standard Longest Common Subsequence algorithm.

Input
This is a test. test Hello!

The document provides late-breaking information late breaking.

Output
1. Length of longest match: 1 2. Blank! 3. Length of longest match: 2