Submission

Status:

----------

Subtask/Task Score:

0/100

Score: 0

User: erng

Problemset: Consecutive Subsequence

Language: cpp

Time: 0.005 second

Submitted On: 2026-03-06 13:26:23

#include <bits/stdc++.h>

using namespace std;

const int nx=1e6;
string n;
int arr[nx], k, cnt=1, ans, e;
vector<int> num, v;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    while (cin>>k) num.push_back(k);
    sort(num.begin(), num.end());
    num.erase(unique(num.begin(), num.end()), num.end());
    for (int i=1; i<num.size(); i++)
    {
        if (num[i]==num[i-1]+1) cnt++;
        else
        {
            if (ans>cnt) continue;
            else
            {
                ans=cnt;
                e=num[i-1];
            }
            cnt=1;
        }
    }
    for (int i=e-ans+1; i<=e; i++) cout<<i<<" ";
}