解题思路:
注意事项:
参考代码:
#include <stdio.h>
int num[1000];
int maxLen[1000];
int main(void)
{
int i, j, max = 0, length = 1;
while (scanf("%d", &num[length]) != EOF)
{
maxLen[length] = 1;
length++;
}
for (i = 2;i < length;i++)
for (j = 1;j < i;j++)
if (num[i] <= num[j])
{
if (maxLen[i] > maxLen[j] + 1)
maxLen[i] = maxLen[i];
else
maxLen[i] = maxLen[j] + 1;
}
for (i = 1;i < length;i++)
if (maxLen[i] > max)
max = maxLen[i];
printf("%d", max);
return 0;
}
0.0分
3 人评分