习题3.4 最长连续递增子序列

最新推荐文章于 2025-08-14 18:10:12 发布

原创最新推荐文章于 2025-08-14 18:10:12 发布 · 128 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#算法 #c++ #数据结构

习题3.4 最长连续递增子序列

#include<bits/stdc++.h>
using namespace std;
int maxs = 0;
vector<int> ans, res;
int main(){
    int n;
    cin >> n;
    int pre = 0;
    int cnt = 1;
    cin >> pre;
    res.push_back(pre);
    for (int i = 1; i < n; i ++){
        int a;
        cin >> a;
        if (a <= pre){
            if (maxs < cnt){
                maxs = max(maxs, cnt);
                ans = res;
            }
            cnt = 1;
            res.clear();
        }else cnt ++;
        pre = a;
        res.push_back(a);
    }

    if (cnt == n || res.size() > ans.size()) ans = res;
    for (int i = 0; i < ans.size(); i ++){
        if (i) cout << " ";
        cout << ans[i];
    }
    return 0;
}