forked from bamsarts/DS-ALGO
-
Notifications
You must be signed in to change notification settings - Fork 0
/
longest-common-subsequence.java
77 lines (77 loc) · 2.39 KB
/
longest-common-subsequence.java
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
/**
* CREATED BY ROSHAN SINGH
*
*/
import java.io.*;
import java.util.*;
class Main{
static class FastScanner { // for string + number
BufferedReader br;
StringTokenizer st;
public FastScanner() {
br = new BufferedReader(new InputStreamReader(System.in));
}
public FastScanner(String file) throws IOException{
br = new BufferedReader(new InputStreamReader(new FileInputStream(file)));
}
String next() {
while (st == null || !st.hasMoreElements()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
long nextLong() {
return Long.parseLong(next());
}
double nextDouble() {
return Double.parseDouble(next());
}
String nextLine() {
String str = "";
try {
str = br.readLine();
} catch (IOException e) {
e.printStackTrace();
}
return str;
}
}
public static void main(String[] args) throws IOException {
FastScanner s = new FastScanner();
// FastScanner s = new FastScanner("INPUT");
OutputStream outputStream = System.out;
// OutputStream outputStream = new FileOutputStream("OUTPUT");
PrintWriter o = new PrintWriter(outputStream);
// start
int t = s.nextInt();
while (t-->0){
int n = s.nextInt();
int m = s.nextInt();
int[][] dp = new int[n+1][m+1];
char[] an = (s.next()).toCharArray();
char[] am = (s.next()).toCharArray();
boolean[] v = new boolean[30];
int max = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if(an[i-1] == am[j-1]){
dp[i][j] = dp[i-1][j-1]+1;
}else{
dp[i][j] = Math.max(dp[i-1][j],dp[i][j-1]);
}
}
}
// for (int[] i : dp) System.out.println(Arrays.toString(i));
o.println(dp[n][m]);
}
// end
o.close();
}
}