最长不下降子序列

#include <iostream>
using namespace std;

const int N = 100;
int a[N], dp[N]; 

int main() {
	int n, ans = 0;
	
	scanf("%d", &n);
	for (int i = 0; i < n; i++) {
		scanf("%d", &a[i]);
	}
	
	for (int i = 0; i < n; i++) {
		dp[i] = 1; //默认和自己成为最长不下降子序列 
		for (int j = 0; j < i; j++) {
			if (a[i] >= a[j] && dp[j] + 1 > dp[i]) {
				dp[i] = dp[j] + 1;
			}
		}
		
		ans = max(ans, dp[i]); 
	}
	
	printf("%d\n", ans);

	return 0;
}

/**********************
8
1 2 3 -9 3 9 0 11
输出： 6 
***********************/