uva 10192 Vacation

又是最长公共子序列

#include <stdio.h>
#include <string.h>

char buf1[200];
char buf2[200];
int dp[200][200];

int _max(int a, int b){
	return a > b ? a : b;
}

void func(int case_count){
	int i, j;
	int len1, len2;
	len1 = strlen(buf1+1);
	len2 = strlen(buf2+1);

	for(i=1; i<=len1; i++){
		for(j=1; j<=len2; j++){
			if(buf1[i] == buf2[j]){
				dp[i][j] = dp[i-1][j-1] + 1;
			}
			else{
				dp[i][j] = _max(dp[i-1][j], dp[i][j-1]);
			}
		}
	}
	printf("Case #%d: you can visit at most %d cities.\n", case_count, dp[len1][len2]);
}

int main(void){
	int case_count = 1;
	//freopen("input.dat", "r", stdin);
	while(1){
		gets(buf1+1);
		if(0 == strcmp(buf1+1, "#"))
			break;
		gets(buf2+1);
		func(case_count++);
	}
	return 0;
}