Submission

Score: 100

User: Kx

Problemset: Consecutive Subsequence

Language: cpp

Time: 0.003 second

Submitted On: 2026-03-20 10:50:20

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

int main() {
    vector<int> n, id;

    while(true) {
        string s; cin >> s;
        if((int)s.size() == 1) {
            int ch = (int)s[0];
            if(ch < '0' || ch > '9') {
                break;
            }
        }
        n.push_back(stoi(s));
    }

    sort(n.begin(), n.end());

    vector<vector<int>> all;

    vector<int> can;
    int idx = 0;

    for(int i = 1; i < (int)n.size(); ++i) {
        if(n[i] - n[i - 1] == 0) continue;

        if(abs(n[i] - n[i - 1]) == 1) {
            if(can.empty()) {
                can.push_back(n[i - 1]);
            }
            can.push_back(n[i]);
        } else if(can.size() > 0){
            all.push_back(can);
            can.clear();
        } else {
            continue;
        }
    }

    int i = max_element(all.begin(), all.end(), [](const vector<int> &a, const vector<int> &b) {
        return a.size() < b.size();
    }) - all.begin();


    for(auto x : all[i]) {
        cout << x << ' ';
    }

    return 0;
}