Submission
Status:
P--PPPPPPP
Subtask/Task Score:
80/100
Score: 80
User: navysrimuang
Problemset: Consecutive Subsequence
Language: cpp
Time: 0.002 second
Submitted On: 2026-03-15 14:07:13
#include<bits/stdc++.h>
using namespace std;
int main(){
unordered_set<int> st;
while(true){
string s; cin >> s;
if(isalpha(s[0])) break;
int x = stoi(s);
st.insert(x);
}
int mx = 0, ll = 0, rr = 0;
for(int x : st){
if(!st.count(x-1)){
int ss = x;
int cnt = 1;
while(st.count(x+1)){
cnt++;
x++;
}
int ee = x;
if(cnt > mx){
mx = cnt;
ll = ss;
rr = ee;
}
}
}
for(int i = ll; i<= rr;i++) cout << i << " ";
return 0;
}