#include<bits/stdc++.h> using namespace std; //二叉树定义结构 typedef struct node{ char data; struct node *lchild, *rchild; }*BST;...

#include<bits/stdc++.h> using namespace std; const int maxn = 1e5 + 5; int a[maxn]; int dp[maxn]; int n; int main(){ while(~...

#include<bits/stdc++.h> using namespace std; const int maxn = 100 + 5; string dp[maxn][maxn]; string s1,s2; int main(){ while...

#include<bits/stdc++.h> using namespace std; const int maxn = 30+5; const int INF = 0x3f3f3f3f; char mpt[maxn][maxn]; int dir[4][2...

#include<bits/stdc++.h> using namespace std; const int MAX = 1005; int dp[MAX][MAX]; string a,b; //dp[i][j]是指字符串1中的前i个字符和字符串2中的前j个字符的编...