9251 LCS

BOJ::9251 LCS

https://www.acmicpc.net/problem/9251

#include <stdio.h>
#include <cstring>
using namespace std;
 
char s1[1000];
char s2[1000];
int map[1001][1001];
 
int max(int a, int b) {
    return (a > b) ? a : b;
}
 
int main() {
    scanf("%s %s", &s1, &s2);
 
    int n1 = strlen(s1);
    int n2 = strlen(s2);
 
    //LCS 알고리즘
    for (int i = 1; i <= n1; i++) {
        for (int j = 1; j <= n2; j++) {
            if (s1[i-1] == s2[j-1]) {
                map[i][j] = map[i - 1][j - 1] + 1;
            }
            else {
                map[i][j] = max(map[i - 1][j], map[i][j - 1]);
            }
        }
    }
    
    printf("%d\n", map[n1][n2]);
}