CF463D.Gargari and Permutations

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

Gargari got bored to play with the bishops and now, after solving the problem about them, he is trying to do math homework. In a math book he have found $k$ permutations. Each of them consists of numbers $1,2,...,n$ in some order. Now he should find the length of the longest common subsequence of these permutations. Can you help Gargari?

You can read about longest common subsequence there: https://en.wikipedia.org/wiki/Longest_common_subsequence_problem

输入格式

The first line contains two integers $n$ and $k$ $(1<=n<=1000; 2<=k<=5)$ . Each of the next $k$ lines contains integers $1,2,...,n$ in some order — description of the current permutation.

输出格式

Print the length of the longest common subsequence.

输入输出样例

输入#1
```
4 3
1 4 2 3
4 1 2 3
1 2 4 3
```
输出#1
```
3
```

说明/提示

The answer for the first test sample is subsequence [1, 2, 3].

首页