POJ-2264（DP + 保存路径）

题目：http://poj.org/problem?id=2264

一开始都忘了保存DP路径了，瞎想了N久，通过这题复习LCS动态规划的同时，也回顾了打印DP路径的方法，好题

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define MAX_LEN		108

const int HORIZONAL = 1;
const int DIAGNAL = 2;
const int VERTICAL = 3;
int lcs[MAX_LEN][MAX_LEN] = {0};
int dir[MAX_LEN][MAX_LEN] = {0};

char* trace(char* p, const char* s, int& i, const char* t, int& j)
{
	if(!i || !j) return p;
	if(dir[i][j] == HORIZONAL) *p = t[j--];
	else if(dir[i][j] == VERTICAL) *p = s[i--];
	else *p = s[i--], --j;
	trace(p+1, s, i, t, j);
}
char* join(char* p, const char* s, int slen, const char* t, int tlen)
{
//step 1: lcs DP
	for(int i = 1; i <= slen; ++i){
		for(int j = 1; j <= tlen; ++j){
			if(lcs[i-1][j] > lcs[i][j-1]){
				lcs[i][j] = lcs[i-1][j];
				dir[i][j] = VERTICAL;
			}
			else{
				lcs[i][j] = lcs[i][j-1];
				dir[i][j] = HORIZONAL;
			}
			if(s[i] == t[j] && lcs[i][j] < lcs[i-1][j-1] + 1){
				lcs[i][j] = lcs[i-1][j-1] + 1;
				dir[i][j] = DIAGNAL;
			}
		}
	}
//step 2: trace lcs string
	int i = slen, j = tlen;
	char* q = trace(p, s, i, t, j);
	for(; j; --j) *q++ = t[j];
	for(; i; --i) *q++ = s[i];
	*q = '\0';
	reverse(p, q);
	return p;
}

int main()
{
	char s[MAX_LEN], t[MAX_LEN], p[220];
	int slen, tlen;
	while(~scanf("%s%s", s + 1, t + 1)){
		slen = strlen(s + 1);
		tlen = strlen(t + 1);
		puts(join(p, s, slen, t, tlen));
	}
	return 0;	
}