Codeforces 463D

题目链接

D. Gargari and Permutations

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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

Input

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.

Output

Print the length of the longest common subsequence.

Sample test(s)

input

4 3
1 4 2 3
4 1 2 3
1 2 4 3

output

3

Note

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

题意：给出ｋ个ｎ的全排列，求ｋ个串的最长公共子序列（1<= k <= 5).

刚拿到题感觉是个dp，但是又没有明确的思路，ｙｙ了两发，发现不对，就没有做了。

今天才知道这个题可以通过建图然后得到若干个DAG，然后求最长路。

让我想起了某此CF的Ｃ题。那题可以转化为求MST，万万没想到。

今天记下，以后应多往图这方面想，根据题意是否能构造出图来，然后我只想说题水人更水。

本题可以这样来构图，如果在每个序列中，ｉ都在ｊ前面，那么可以从ｉ向ｊ连一条边。

最后求以每个点为根的最长路，取最大值即可。

Accepted Code:

 /*************************************************************************
     > File Name: 463D.cpp
     > Author: Stomach_ache
     > Mail: sudaweitong@gmail.com
     > Created Time: 2014年08月31日 星期日 22时02分01秒
     > Propose:
  ************************************************************************/

 #include <cmath>
 #include <string>
 #include <cstdio>
 #include <vector>
 #include <fstream>
 #include <cstring>
 #include <iostream>
 #include <algorithm>
 using namespace std;
 /*Let's fight!!!*/

 #define rep(i, n) for (int i = (0); i < (n); i++)
 #define FOR(i, n) for (int i = (1); i <= (n); i++)
 int n, k;
 int a[][], dp[], pos[][];
 vector<int> G[];
 bool vis[];

 bool check(int x, int y) {
       rep (i, k) if (pos[i][x] > pos[i][y]) return false;
     return true;
 }

 void dfs(int u) {
       if (vis[u]) return;
     vis[u] = true;
     int sz = (int)G[u].size();
     rep (i, sz) {
           int v = G[u][i];
         dfs(v);
         dp[u] = max(dp[u], dp[v]);
     }
     dp[u]++;
 }

 int main(void) {
     cin >> n >> k;
     int a;
     rep (i, k) rep(j, n) cin >> a, pos[i][a] = j;
     FOR (i, n) FOR (j, n) if (i != j && check(i, j)) G[i].push_back(j);

 //    FOR (i, n) rep (j, G[i].size()) cerr << i << "-->" << G[i][j] << endl;

     memset(vis, false, sizeof(vis));
     FOR (i, n) if (!vis[i]) dfs(i);

     int ans = ;
     FOR (i, n) ans = max(ans, dp[i]);
     cout << ans << endl;

     return ;
 }