Code/CRSCNTRY.cpp at master · sushiljacksparrow/Code · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
/*Sushil Kumar Singh */
#include <cassert>
#include <cctype>
#include <cfloat>
#include <cmath>
#include <cstdarg>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <iomanip>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <valarray>
#include <vector>
#include <ext/numeric>
#include <ext/hash_map>
#include <ext/hash_set>
#include <ext/algorithm>
//#define OFF ios::sync_with_stdio(false)

using namespace std;
using namespace __gnu_cxx;

#define pb push_back
#define vi vector<int>
#define vii vector<vi>
#define ii pair<int,int>
#define vs vector<string>
#define all(v) (v).begin(), (v).end()
#define For(i,x) for(int i=0;i<x;i++)

#define MAX 2002

int cardsA[MAX], cardsB[MAX], dp[2][MAX];

int lcs(int len1, int len2)
{
	int i, j;
	for(j=0;j<=len2;j++)
		dp[0][j]=0;

	for(i=1;i<=len1;i++)
	{
		for(j=1;j<=len2;j++)
		{
			if(cardsA[i-1]==cardsB[j-1])
				dp[i&1][j] = dp[!(i&1)][j-1]+1;
			else
				dp[i&1][j] = max(dp[!(i&1)][j], dp[i&1][j-1]);
		}
	}
	return dp[len1&1][len2];
}

int main()
{
    int t, len1, len2, n, best;
	scanf("%d", &t);
	while(t--)
	{
		len1 = best = 0;
		while(scanf("%d", &n)==1 && n)
			cardsA[len1++] = n;
		while(scanf("%d", &n)==1 && n)
		{
			len2 = 0;
			cardsB[len2++] = n;
			while(scanf("%d", &n)==1 && n)
				cardsB[len2++] = n;
			best = max(best, lcs(len1, len2));
		}
		printf("%d\n", best);
	}
	return 0;
}