Submission

Score: 100

User: mantaggez

Problemset: Consecutive Subsequence

Language: cpp

Time: 0.002 second

Submitted On: 2026-03-23 17:27:15

#include <bits/stdc++.h>

using namespace std;
using pii = pair<int, int>;

const int INF = 1e9;

string s;
int idx;
vector<int> ans, num;
// map<int, vector<int>> num;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    while(cin >> s) {
        if('9' < s[0]) break;
        // idx++;
        num.push_back(stoi(s));
    }
    sort(num.begin(), num.end());
    num.erase(unique(num.begin(), num.end()), num.end());
    // cout << "Num : ";
    // for(int it : num) cout << it << ' '; cout << '\n';
    int n = num.size(), cnt = 0;
    vector<int> tmp;
    
    for(int i=1;i<=n;i++) {
        // cout << "debug : " << num[i] << ' ' << num[i - 1] << '\n';
        if(num[i] == (num[i - 1] + 1) && i != n) {
            tmp.push_back(num[i]);
        }
        else {
            if(ans.size() < tmp.size()) {
                ans.clear();
                ans = tmp;
                // cout << "ans : ";
                // for(auto t : tmp) cout << t << ' '; cout << '\n';
            }
            tmp.clear();
        }
    }

    if(ans.empty()) {
        cout << *num.begin() << '\n';
        return 0;
    }

    cout << *ans.begin() - 1 << ' ';
    for(int a : ans) cout << a << ' '; cout << '\n';

    // pii prev = {0, 0};
    // vector<int> tmp;
    // for(auto& [val, i] : num) {
    //     auto [pv, pi] = prev;
    //     auto it = upper_bound(i.begin(), i.end(), pv);
    //     if(pv + 1 == val) {

    //     }

    // }

    return 0;
}