【计算机考研机试指南】第十二章 动态规划：最长递增子序列——拦截导弹_北大

#include <iostream>
#include <cstdio> 

using namespace std;

const int MAXN = 25;

int height[MAXN];
int dp[MAXN];

int main(int argc, char** argv) {
	int n;
	while(scanf("%d", &n) != EOF){
		for(int i = 0; i < n; i++){
			scanf("%d", &height[i]);
		}
		int answer = 0;
		for(int i = 0; i < n; i++){
			dp[i] = 1;
			for(int j = 0; j < i; j++){
				if(height[i] <= height[j]){
					dp[i] = max(dp[i], dp[j] + 1);
				}
			}
			answer = max(answer, dp[i]);
		}
		printf("%d\n", answer);
	}
	return 0;
}