uva 11404(dp)

题意：有一个字符串，需要删除尽量少的字母形成一个回文串，输出最后的回文串。

题解：用一个结构体f[i][j]存结果回文串和它的长度，f[i][j]表示从左数前i个字符和从右数前j个字符可以组成的回文串是什么。根据是否str[i] == str[j]来更新f[i][j]。

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 1005;
string s1, s2;
struct P {
	int n;
	string str;
	bool operator < (const P& a) const {
		return n > a.n || (n == a.n && str < a.str);
	}
}f[N][N];

int main() {
	while (cin >> s1) {
		s2 = s1;
		reverse(s2.begin(), s2.end());
		int len = s1.length();
		for (int i = 0; i <= len; i++) {
			f[0][i].n = f[i][0].n = 0;
			f[0][i].str = f[i][0].str = "";
		}
		for (int i = 1; i <= len; i++)
			for (int j = 1; j <= len; j++) {
				if (s1[i - 1] == s2[j - 1]) {
					f[i][j] = f[i - 1][j - 1];
					f[i][j].n++;
					f[i][j].str += s1[i - 1];
				}
				else
					f[i][j] = min(f[i - 1][j], f[i][j - 1]);
			}
		string res = f[len][len].str;
		int nn = f[len][len].n;
		for (int i = 0; i < nn / 2; i++)
			cout << res[i];
		if (nn & 1)
			for (int i = nn / 2; i >= 0; i--)
				cout << res[i];
		else
			for (int i = nn / 2 - 1; i >= 0; i--)
				cout << res[i];
		cout << endl;
	}
	return 0;
}