算法训练 拦截导弹（最长递增子序列和最长递减子序列问题，输入回车时停止输入）

                 1 #include<iostream>
 2 #include<vector>
 3usingnamespace std;
 4//author:zq
 5//最长递增子序列  6int addLong(vector<int>obj){
 7     vector<int>result;
 8     result.push_back(obj[0]);
 9     vector<int>::iterator it;
10for(it=obj.begin()+1;it!=obj.end();it++){
11if(*it>result[result.size()-1]){
12             result.push_back(*it);
13         }else{
14for(int i=0;i<result.size();i++){
15if(*it<result[i]){
16                     result[i]=*it;
17break;
18                }
19            }
20        }
21    }
22return result.size();
23}
2425//最长递减子序列 26int minLong(vector<int>obj){
27     vector<int>result;
28     result.push_back(obj[0]);
29     vector<int>::iterator it;
30for(it=obj.begin()+1;it!=obj.end();it++){
31if(*it<result[result.size()-1]){
32             result.push_back(*it);
33         }else{
34for(int i=0;i<result.size();i++){
35if(*it>result[i]){
36                     result[i]=*it;
37break;
38                }
39            }
40        }
41    }
42return result.size();
43}
44//    cout<<result.size();45int main(){
46     vector<int>objs;
47int p;
48char s;
49while(s!=‘\n‘){
50         cin>>p;
51         s=getchar();
52        objs.push_back(p);
53    }
54int max,min;
55     max=addLong(objs);
56     min=minLong(objs);
57     cout<<min<<endl<<max;
58return0;
59 }