Submission
Status:
PPPPPPPPPP
Subtask/Task Score:
100/100
Score: 100
User: erng
Problemset: Consecutive Subsequence
Language: cpp
Time: 0.003 second
Submitted On: 2026-03-06 13:49:26
#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);
if (num.size()<1) return 0;
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 (cnt>ans)
{
ans=cnt;
e=i-1;
}
cnt=1;
}
}
if (cnt>ans)
{
ans=cnt;
e=num[num.size()-1];
}
for (int i=e-ans+1; i<=e; i++) cout<<num[i]<<" ";
}