最长公共上升子序列及其方案数量

LCIS

题面翻译

求两个串的最长公共上升子序列。

题目描述

This problem differs from one which was on the online contest.

The sequence a_{1},a_{2},…,a_{n} is called increasing, if a_{i} for i .

The sequence s_1,s_2,…,s_k is referred to as the subsequence of the sequence a_1,a_2,…,a_n if there exists such a set of indexes 1\leq i₁ that a_ijs_j. In other words, the subsequence s can be derived from a by omitting some elements.

You are provided with two sequences of integer numbers. You determine their longest common increasing subsequence