如题 球球佬看一眼

#include<iostream>
#include<queue>
using namespace std;
int bigger(int x, int y)
{
	int d;
	d = x > y ? x : y;
	return d;
}
int dp[100005];
int main()
{
	int i, j,n;
	int max;
	int num[100005];
	char ch;
	memset(num, 0, sizeof(num));
	n = 0;
	while (scanf("%d", num+(++n)) != EOF);
	--n;
	dp[1] = 1;
	for (i = 2; i <=n; i++)
	{
		for (j = 1; j < i; j++)
		{
			if (num[j] >= num[i])
			{
				max = 0;
				max = bigger(dp[j] + 1, max);
				dp[i] = dp[j] + 1;
			}
		}
	}
	cout << dp[n];
	return 0;
}