Comments

• 
  

  4

  

  hoangquys  commented on Nov. 22, 2025, 2:20 p.m.

  Ý Tưởng Giải

  ---

  1. Đặt dp[n][m] n là độ dài string A, m là độ dài string B

  2. Trường hợp cơ sở: dp[i][0] = 0; dp[0][j] = 0

  3. Công thức truy hồi: Nếu a[i] == b[j] thì dp[i][j] = dp[i - 1][j - 1] + 1; else dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);

  4. Kết quả bài toán: dp[n][m]

• 
  

  2

  

  hieuducle  commented on Aug. 17, 2025, 2:03 p.m.

  include<bits/stdc++.h>

  using namespace std; string x , y , dp[2005][2005]; string cmp (string a,string b) { while(a.size() < b.size()) a = '0' + a; while(b.size() < a.size()) b = '0' + b; if(a>b)return a; return b; } int main () { iosbase::syncwith_stdio(false); cin.tie(nullptr);

  cin >> x >> y;
  int m = x.size() , n = y.size();
  x = " " + x; 
  y = " " + y;
  dp[0][0] = '0';
  for(int i=1;i<=m;++i)
  {
      for(int j=1;j<=n;++j)
      {
          if(x[i] == y[j]) dp[i][j] = dp[i-1][j-1] + x[i];
          else dp[i][j] = cmp(dp[i-1][j] , dp[i][j-1]);
      }
  }
  string h = dp[m][n];
  while(h[0] == '0') h.erase(0,1);
  cout << h.size();
  return 0;
  

  }

• 
  

  -7

  

  zatarainbow  commented on Nov. 25, 2024, 1:17 a.m.

  include<bits/stdc++.h>

  using namespace std; string s1,s2,rt=""; long n,m,f[3009][3009],i,j,ma; int main() { iosbase::syncwith_stdio(false); cin.tie(nullptr);cout.tie(nullptr); cin>>s1>>s2; n=s1.size();m=s2.size(); s1=" "+s1; s2=" "+s2; for(i=1;i<=n;i++) for(j=1;j<=m;j++) { 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[n][m]; return 0; }

  This comment is hidden due to too much negative feedback. Show it anyway.

• 
  

  -9

  

  vdtue  commented on Aug. 20, 2024, 2:29 p.m.

  xD

  This comment is hidden due to too much negative feedback. Show it anyway.

• 
  

  -14

  

  frekraiko  commented on Aug. 17, 2024, 2:09 a.m.

  cailonmaaaaaaaaaaaaaaaaaaaaaaaa

  This comment is hidden due to too much negative feedback. Show it anyway.

• 
  

  24

  

  CBNK30_dinhson  commented on July 31, 2023, 3:36 a.m.

  ảo thật đấy, từ bé đến giờ

• 
  

  15

  

  CBNK30_hoangphu  commented on July 31, 2023, 3:46 a.m.

  các bạn chú ý ngôn từ của bản thân đi

• 
  

  -83

  

  htmanh  commented on July 31, 2023, 3:47 a.m.

  sech ko anh

  This comment is hidden due to too much negative feedback. Show it anyway.

• 
  

  -36

  

  10tin_hangan  commented on July 31, 2023, 3:47 a.m.

  lam tro jv?

  This comment is hidden due to too much negative feedback. Show it anyway.

• 
  

  -55

  

  htmanh  commented on July 31, 2023, 3:46 a.m.

  tin juan chua a

  This comment is hidden due to too much negative feedback. Show it anyway.

• 
  

  -36

  

  10tin_hangan  commented on July 31, 2023, 3:42 a.m.

  ngao da

  This comment is hidden due to too much negative feedback. Show it anyway.