最长连续子序列

 1 #include<iostream>
 2 #include<algorithm>
 3 #include<vector>
 4 #include<map>
 5 #include<string>
 6 #include<sstream>
 7 #include<set>
 8 using namespace std;
 9 int main()
10 {
11     int n;
12     cin >> n;
13     vector<int> vet(n);
14     for (int i = 0; i < n; i++)
15     {
16         cin >> vet[i];
17     }
18     vector<int> d(n + 1);
19     d[0] = 0;
20     d[1] = 1;
21     int result = INT_MIN;
22     int max = INT_MIN;
23     for (int i = 1; i < n; i++)
24     {
25         if (vet[i]>vet[i - 1])
26         {
27             result = d[i] + 1;
28         }
29         else
30         {
31             result = 1;
32         }
33         if (result > max)
34         {
35             max = result;
36             d[i + 1] = max;
37         }
38         else
39             d[i + 1] = result;
40     }
41     cout << max << endl;
42     system("pause");
43     return 0;
44 }

 

转载于:https://www.cnblogs.com/wujufengyun/p/7349209.html