最长公共子序列php,Atcoder F - LCS (DP-最长公共子序列，输出字符串)

#include

#include

#include

#include

#include

#include

#include

#include

#include

#include

#define sz(a) int(a.size())

#define all(a) a.begin(), a.end()

#define rep(i,x,n) for(int i=x;i

#define repd(i,x,n) for(int i=x;i<=n;i++)

#define pii pair

#define pll pair

#define gbtb ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)

#define MS0(X) memset((X), 0, sizeof((X)))

#define MSC0(X) memset((X), '\0', sizeof((X)))

#define pb push_back

#define mp make_pair

#define fi first

#define se second

#define eps 1e-6

#define gg(x) getInt(&x)

using namespace std;

typedef long long ll;

inline void getInt(int* p);

const int maxn=;

const int inf=0x3f3f3f3f;

/*** TEMPLATE CODE * * STARTS HERE ***/

int dp[][];

char a[maxn];

char b[maxn];

int n,m;

int c[maxn];

int pre[maxn];

int lis[maxn];

int main()

{

scanf("%s",a);

scanf("%s",b);

n=strlen(a);

m=strlen(b);

for(int i=n-;i>=;i--)

{

for(int j=m-;j>=;j--)

{

if(a[i]==b[j])

{

dp[i][j]=dp[i+][j+]+;

}else

{

dp[i][j]=max(dp[i+][j],dp[i][j+]);

}

}

}

// cout<

int i=;

int j=;

while(i

{

if(a[i]==b[j])

{

putchar(a[i]);

i++;

j++;

}else if(dp[i][j]==dp[i+][j])

{

i++;

}else

{

j++;

}

}

return ;

}

inline void getInt(int* p) {

char ch;

do {

ch = getchar();

} while (ch == ' ' || ch == '\n');

if (ch == '-') {

*p = -(getchar() - '');

while ((ch = getchar()) >= '' && ch <= '') {

*p = *p * - ch + '';

}

}

else {

*p = ch - '';

while ((ch = getchar()) >= '' && ch <= '') {

*p = *p * + ch - '';

}

}

}