POJ 1159 Palindrome

1月2日,一天一题

Description

给一个字符串,问再加多少个能变成会问

Algorithm

和这个字符串的逆串求一个LCS
n - LCS就是答案

Hint

本题直接开二维数组要爆炸,用short或者滚动数组来做,滚动数组还需研究

Code

//#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
const int MAXN = 5000 + 9;
char s1[MAXN], s2[MAXN];
short dp[MAXN][MAXN];
int n;
int d(int i, int j)
{
    if (i < 0 || j < 0) return 0;
    return dp[i][j];
}
void solve()
{
    scanf("%s", s1);
    for (int i = 0; i < n; i++) {
        s2[i] = s1[n - i - 1];
    }
    memset(dp, 0, sizeof(dp));
    for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++) {
        if (s1[i] == s2[j]) {
            dp[i][j] = d(i - 1, j - 1) + 1;
        } else {
            dp[i][j] = max(d(i , j - 1), d(i - 1, j));
        }
    }
    cout << n - dp[n - 1][n - 1] << endl;
}
int main()
{
    while (scanf("%d\n", &n) != EOF) {
        solve();
    }
}

UPD 滚的数组写法

就是给i加上一个i % 2就好,同时改成了dp[i][j]表示字符串中的i,也就是dp[1]表示s[0],省得处理越界问题

//#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
const int MAXN = 5000 + 9;
char s1[MAXN], s2[MAXN];
int dp[2][MAXN];
int n;
void solve()
{
    scanf("%s", s1);
    for (int i = 0; i < n; i++) {
        s2[i] = s1[n - i - 1];
    }
    memset(dp, 0, sizeof(dp));
    for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++) {
        if (s1[i - 1] == s2[j - 1]) {
            dp[i%2][j] = dp[(i-1)%2][j - 1] + 1;
        } else {
            dp[i%2][j] = max(dp[(i-1)%2][j], dp[i%2][j - 1]);
        }

    }
    cout << n - dp[n%2][n] << endl;
}
int main()
{
    while (scanf("%d\n", &n) != EOF) {
        solve();
    }
}