Submission

Status:

P--PPPPPPP

Subtask/Task Score:

80/100

Score: 80

User: goine

Problemset: Consecutive Subsequence

Language: cpp

Time: 0.004 second

Submitted On: 2026-03-25 19:21:28

#include<bits/stdc++.h>
using namespace std;

int main() {
    vector<int> nums;
    string input;

    while (cin >> input) {
        if (isalpha(input[0])) break;
        nums.push_back(stoi(input));
    }

    unordered_set<int> s(nums.begin(), nums.end());

    int best_len = 0;
    vector<int> best_seq;

    for (int x : s) {
        if (!s.count(x - 1)) {
            vector<int> current;
            int cur = x;

            while (s.count(cur)) {
                current.push_back(cur);
                cur++;
            }

            if ((int)current.size() > best_len) {
                best_len = current.size();
                best_seq = current;
            }
        }
    }

    for (int x : best_seq) {
        cout << x << ' ';
    }
}