UVa 10100

From Algorithmist
Jump to navigation Jump to search

10100 - Longest Match[edit]

Summary[edit]

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

Explanation[edit]

Use the standard Longest Common Subsequence algorithm.

Input[edit]

This is a test.
test
Hello!

The document provides late-breaking information
late breaking.

Output[edit]

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

Solutions[edit]