暑期dp46道(45)--HDOJ 1257 最少拦截系统 最长递增子序列

题目链接：hdoj 1257

AC CODE:

#include<cstdio>
#include<cstring>
#include<string>

#define debug 0
#define M(a) memset(a,0,sizeof(a))
#define Max(a,b) ((a>b)?a:b)
#define REP(o) for(int i=1;i<=o;i++)
const int maxn = 1000 + 5;
int n, w[maxn], dp[maxn];

void Do(){
	int ans = 0;
	//printf("%d\n",dp[1]);
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j<i; j++)
		{
			if (w[j]<w[i] && dp[j] + 1>dp[i])
			{
				dp[i] = dp[j] + 1;
			}
		}
		ans = Max(ans, dp[i]);
	}
	printf("%d\n", ans);
}

int main(){
#if debug
	freopen("in.txt", "r", stdin);
#endif//debug
	while (~scanf("%d", &n))
	{
		//M(dp);

		REP(n)
		{
			scanf("%d", &w[i]);
			dp[i] = 1;
		}
		Do();
	}
	return 0;
}