新月

Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 757    Accepted Submission(s): 282 Problem Description Given a sequence of numbers A

Vasya has decided to build a zip-line on trees of a nearby forest. He wants the line to be as long as possible but he doesn't remember exactly the heights of all trees in the forest. He is sure that h

Description 给你一串整数，从左到右按顺序挑出一些数字，构成严格下降序列，问最长能构成多长 如6个数4 5 2 4 2 2， 那么最长可以挑出5 4 2，长度为3 Input 首先输出T（T 每组数据：  首先输入n表示有几个数(1 后面一行跟着n个整数 Output 对于每个样例输出一个数字，表示最长的长度 Sample Input 1 6 4 5

Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 2346    Accepted Submission(s): 734 Problem Description 　　大家都知道小明最喜欢研究跟序列有关的问题了，可是也就