UVA 10192 Vacation

最新推荐文章于 2019-07-23 20:36:01 发布

Wall_F

最新推荐文章于 2019-07-23 20:36:01 发布

阅读量857

点赞数

分类专栏： UVA

本文链接：https://blog.csdn.net/Wall_F/article/details/8272369

版权

UVA 专栏收录该内容

86 篇文章 0 订阅

订阅专栏

最长上升子序列，尼玛，用scanf输入TLE，gets AC。

#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <string>
using namespace std;

const int MAXN = 1010;

char x[MAXN], y[MAXN];
int d[MAXN][MAXN];

int dp(int n, int m)
{
	for(int i = 1; i <= n; i++) d[i][0] = 0;
	for(int i = 1; i <= m; i++) d[0][i] = 0;
	for(int i = 1; i <= n; i++)
	{
		for(int j = 1; j <= m; j++)
		{
			if(x[i-1] == y[j-1]) d[i][j] = d[i-1][j-1]+1;
			else if(d[i-1][j] >= d[i][j-1]) d[i][j] = d[i-1][j];
			else d[i][j] = d[i][j-1];
		}
	}
	return d[n][m];
}

int main()
{
	int times = 0;
	while(gets(x) && strcmp(x, "#"))
	{
		gets(y);
		int n = strlen(x), m = strlen(y);
		int ans = dp(n, m);
		printf("Case #%d: you can visit at most %d cities.\n", ++times, ans);
	}
	return 0;
}