Submission

Score: 100

User: Hxluk.ka

Problemset: Consecutive Subsequence

Language: cpp

Time: 0.003 second

Submitted On: 2026-03-15 21:24:58

#include <iostream>
#include <algorithm>
#include <vector>
#include <unordered_map>
using namespace std;
#define pb push_back
vector<int> in;
unordered_map<int, int> mp;
int x;
int main() {
    cin.tie(0)->sync_with_stdio(0);

    while (cin>>x) if (!mp[x]++) in.pb(x);
    sort(in.begin(), in.end());
    
    int n=in.size();
    vector<int> res;
    for (int i=1; i<n; i++) {
        if (in[i]-in[i-1]==1) {
            vector<int> tmp;
            tmp.pb(in[i-1]);
            while (i<n&&in[i]-in[i-1]==1) tmp.pb(in[i++]);
            if (tmp.size()>res.size()) res=tmp;
        }
    }
    for (auto x:res) cout<<x<<' ';
}