蓝肽子序列（蓝桥2020国赛）（线性dp-最长公共子序列）

蓝肽子序列 - 蓝桥云课 (lanqiao.cn)

输入 

LanQiaoBei LanTaiXiaoQiao

输出

2

#include <iostream>
#include <bits/stdc++.h>
#include <cstring>
#include <vector>
#include <unordered_map>
#include <queue>
#include <set>
#include <algorithm>
#define x first
#define y second
#define pb emplace_back
#define fu(i,a,b) for(int i=a;i<=b; ++ i)
#define fd(i,a,b) for(int i=a;i>=b;	-- i)
#define endl '\n'
#define ms(x,y) memset(x,y,sizeof x)
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
using namespace std;
 
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<vector<LL>> VVL;
typedef vector<vector<int>> VVI;
typedef vector<LL> VL;
typedef vector<int> VI;
typedef vector<string> VS;
typedef pair<int,int> PII;
typedef vector<PII> VPII;
typedef pair<PII,int> PIII;
typedef pair<double,double> PDD;
typedef pair<double,int> PDI;
typedef pair<char,int> PCI;
typedef pair<string,int> PSI;
typedef pair<int,string> PIS;
typedef pair<int,char> PIC;
typedef pair<LL,LL> PLL;
typedef __int128 i128;
typedef unsigned long long ULL;
const int N =1e3+ 10,M = N * 2,base =400  ,INF = 0x3f3f3f3f,P = 131;
const double eps = 1e-8;
const int mod = 998244353;
const LL LNF=(LL) INF * INF;
 
int f[N][N];
string a,b;
string s1[N],s2[N];
 
inline void solve()
{
	cin >> a >> b;
	
	int cnt1 =0 ,cnt2 =0 ;
	
// 每个 蓝肽自序列 是以大写字母开头 的字符串
	fu(i,0,a.size() -1)
	{
		if(a[i] >= 'A' && a[i] <='Z') cnt1 ++ ;
		s1[cnt1] += a[i];
	}
	
	fu(i,0,b.size()-1)	
	{
		if(b[i]>='A' && b[i] <='Z')cnt2++;
		s2[cnt2] +=b[i];
	}
	
	fu(i,1,cnt1)
	fu(j,1,cnt2) 
	if(s1[i] == s2[j]) f[i][j] = f[i-1][j-1] +1;
	else f[i][j] = max(f[i-1][j],f[i][j-1]);
	
	cout << f[cnt1][cnt2] <<endl;
	
}
signed main()
{
//  freopen("1.txt","r",stdin);
//	#define int long long 
    ios
//	cout << fixed<<setprecision(2);
    int t=1;
//    cin>>t;
    int now = 1;
    while(t -- )
    {
//      cout<<"Case "; 
//      cout<<"Case #"; 
//      cout<<"Scenario #"; 
//      cout<< now ++ <<": ";
//      cout<< now ++ <<": \n";
        solve();
    }
 
 
    return 0;
}