Submission

Status:

PPPPPPPPPP

Subtask/Task Score:

100/100

Score: 100

User: kavin8888

Problemset: Consecutive Subsequence

Language: cpp

Time: 0.003 second

Submitted On: 2026-03-10 10:48:00

#include<bits/stdc++.h>
using namespace std;
#define int long long
int n,curr=1,b=1,sz=0,bsz=0;
vector<int> a;
signed main(void) {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	while(cin>>n) a.push_back(n);
	sort(a.begin(),a.end());
	sz=a[0],bsz=a[0];
	for(int i=1;i<a.size();++i) {
		if(a[i]==a[i-1]+1) curr++;
		else if(a[i]==a[i-1]) continue;
		else curr=1,sz=a[i];
		if(curr>b) b=curr,bsz=sz;
	} 
	for(int i=0;i<b;++i) cout<<bsz+i<<" ";
	return 0;
}