最长上升子序列
#include<iostream>
using namespace std;
int n;
int a[1100];
int f[1100];
int main()
{
cin >> n;
for (int i = 1; i <= n; i++)
{
cin >> a[i];
f[i] = 1;
}
for (int i = 1; i <= n; i ++ )
{
for (int j = 1; j <= i - 1; j++)
{
if (a[j] < a[i])
{
f[i] = max(f[i], f[j] + 1);
}
}
}
int ans = -1e9;
for (int i = 1; i <= n; i++)
{
ans = max(ans, f[i]);
}
cout << ans;
return 0;
}
最长公共子序列
#include<iostream>
using namespace std;
int n, m;
char a[1100];
char b[1100];
int f[1100][1100];
int main()
{
cin >> n >> m;
scanf("%s%s", a + 1, b + 1);
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= m; j++)
{
f[i][j] = max(f[i - 1][j], f[i][j - 1]);
if (a[i] == b[j])
{
f[i][j] = max(f[i][j], f[i - 1][j - 1] + 1);
}
}
}
cout << f[n][m];
return 0;
}
编辑距离
#include<iostream>
using namespace std;
char a[1100];
char b[1100];
int n, m;
int f[1100][1100];
int main()
{
cin >> n;
scanf("%s", a + 1);
cin >> m;
scanf("%s", b + 1);
for (int i = 0; i <= m; i++) f[0][i] = i;
for (int i = 0; i <= n; i++) f[i][0] = i;
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= m; j ++ )
{
f[i][j] = min(f[i - 1][j]+1, f[i][j - 1]+1);
if (a[i] == b[j])
{
f[i][j] = min(f[i][j], f[i - 1][j - 1]);
}
else
{
f[i][j] = min(f[i][j], f[i - 1][j - 1] + 1);
}
}
}
cout << f[n][m];
return 0;
}