Submission

PPPPPPPPPP

Score: 100

User: krittaphot

Problemset: Consecutive Subsequence

Language: cpp

Time: 0.004 second

Submitted On: 2025-03-15 18:04:59

#include <bits/stdc++.h>

using namespace std;

vector<int> solve(map<int,bool> &mp){
	vector<int> maxseq,seq;
	
	for(auto it = mp.begin();it != mp.end();it++){
		int num = it->first;
		
		if(seq.empty() || seq.back()+1 == num){
			seq.push_back(num);
		}
		else
		{
			if(seq.size() > maxseq.size()){
				maxseq = seq;				
			}
			seq = {num};
		}
	}
	if(seq.size() > maxseq.size()){
		maxseq = seq;			
	}
	
	return maxseq;
}

int main()
{
	map<int,bool> mp;
	int a;
	while(cin >> a)
		mp[a] = true;

	vector<int> ans = solve(mp);
	
	for(int i= 0;i<ans.size();i++)
		cout << ans[i] << " ";	

}