Submission
Status:
PPPPPPPPPP
Subtask/Task Score:
100/100
Score: 100
User: tull
Problemset: Consecutive Subsequence
Language: cpp
Time: 0.002 second
Submitted On: 2026-05-06 09:57:57
#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define bp '\n'
#define vp cout<<'\n';
#define all(A) A.begin(),A.end()
using pii=pair<int,int>;
const int MOD=1e9+7;
const int MNLL=-1e18;
const int MXLL=1e18;
const int N=2e5+10;
int p[104];
signed main(){
cin.tie(nullptr)->sync_with_stdio(false);
string s;
int nw,cnt=1,ps=0,mx=1;
vector<int>t;
while (cin>>s)
{
if(!isdigit(s[(int32_t)s.size()-1]))break;
nw=stoll(s,nullptr,10);
t.emplace_back(nw);
}
sort(all(t));
t.erase(unique(all(t)),t.end());
for(int i=1;i<t.size();++i){
if(t[i]==t[i-1]+1){
++cnt;
}else{
cnt=1;
}
if(cnt>mx){
mx=cnt;
ps=i;
}
}
for(int i=ps-mx+1;i<=ps;++i){
cout<<t[i]<<' ';
}
}