Submission

-P-PP-PPPP

Score: 70

User: Nakornrat

Problemset: Consecutive Subsequence

Language: cpp

Time: 0.003 second

Submitted On: 2025-03-23 00:57:36

#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
int main()
{
    ios::sync_with_stdio(false);cin.tie(0);
    int n;
    vector<int> num;
    while(cin>>n){
        num.push_back(n);
    }
    int cnt = 1;
    int len = num.size();
    int mx = 0;
    int l, lmx, r, rmx;
    l = 0, r = 0;
    sort(num.begin(), num.end());
    for(int i=1;i<len;i++){
        if(num[i]==num[i-1]+1||num[i]==num[i-1]){
            r = i;
            ++cnt;
        }else{
            if(cnt>mx){
                lmx = l;
                rmx = r;
                mx = cnt;
            }
            l=i;
            r=i;
            cnt=1;
        }
    }
    if(cnt>mx){
        lmx = l;
        rmx = r;
        mx = cnt;
    }
    for(int i=lmx;i<=rmx;i++){
        if(i!=rmx&&num[i]==num[i+1]){
            while(i!=rmx&&num[i]==num[i+1])++i;
        }
        cout<<num[i]<<' ';
    }
}