Submission

Score: 100

User: APNICHANAN

Problemset: Consecutive Subsequence

Language: cpp

Time: 0.003 second

Submitted On: 2026-03-14 12:38:05

#include <bits/stdc++.h>
using namespace std;
vector<int> vec;
deque<int> tmp, ans;
map<int, int> m;
int main()
{
    int k;
    while (cin >> k)
    {
        vec.push_back(k);
        m[k] = 1;
    }

    for (auto x : m)
    {
        if (tmp.empty() || (!tmp.empty() && x.first - 1 == tmp.back()))
            tmp.push_back(x.first);
        else
        {
            if (tmp.size() > ans.size())
                swap(ans, tmp);
            if (!tmp.empty())
            {
                tmp.clear();
            }
            tmp.push_back(x.first);
        }
    }

    for (int i = 0; i < ans.size(); i++)
    {
        cout << ans[i] << " ";
    }
    cout << "\n";
}