Submission
Status:
PPPPPPPPPP
Subtask/Task Score:
100/100
Score: 100
User: exoworldgd
Problemset: Consecutive Subsequence
Language: cpp
Time: 0.002 second
Submitted On: 2026-03-28 19:36:54
#pragma GCC optimize("Ofast,unroll-loops,inline,fast-math,omit-frame-pointer")
#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt,tune=native,fma")
#include<bits/stdc++.h>
#define int long long
#define exoworldgd cin.tie(0)->sync_with_stdio(0),cout.tie(0)
using namespace std;
vector<vector<int>>v;
int n,idx,mx;
vector<int>x,t;
signed main(void){
exoworldgd;
while(cin>>n)x.push_back(n);
sort(x.begin(),x.end()),x.erase(unique(x.begin(),x.end()),x.end());
if(x.empty())return 0;
t.push_back(x[0]);
for(int i=1;i<x.size();i++){
if(x[i-1]+1==x[i])t.push_back(x[i]);
else v.push_back(t),t.clear(),t.push_back(x[i]);
}
v.push_back(t);
for(int i=0;i<v.size();i++)if(mx<v[i].size())mx=v[i].size(),idx=i;
for(int i:v[idx])cout<<i<<' ';
}