Submission

PPPPPPPPPP

Score: 100

User: Dormon

Problemset: Consecutive Subsequence

Language: cpp

Time: 0.002 second

Submitted On: 2025-03-14 14:53:49

#include <iostream>
#include <cstdint>
#include <cstring>
#include <vector>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <numeric>
#include <array>
#include <iomanip> // cout << fixed << setprecision(n);
#include <map>

using namespace std;
const bool TEST_CASE = 0;

template<typename T>
typename std::enable_if<std::is_integral<T>::value>::type
Debug(const char* name, T value) {
    std::cout << name << " : " << value << '\n';
}

template<typename T, typename... Args>
typename std::enable_if<std::is_integral<T>::value>::type
Debug(const char* names, T value, Args... args){
    const char* comma = strchr(names, ',');
    std::cout.write(names, comma - names) << " : " << value << " | ";
    Debug(comma + 1, args...);
}
template<typename T> 
ostream& operator<<(ostream& out, vector<T> &a){
    for (auto &x : a) out << x << ' '; 
    return out;
};

#define DORMON
#ifdef DORMON
    #define debug(...) Debug(#__VA_ARGS__, __VA_ARGS__)
#else
    #define debug(...) 
#endif

void solve(){
    int64_t x;
    vector<int64_t> v;
    v.push_back(-1e18);
    while (cin >> x)
        v.push_back(x);

    int n = v.size();
    sort(v.begin(), v.end());
    vector<int> dp(n + 1, 1);
    for (int i = 1;i <= n;i++){
        if (v[i] == v[i - 1] + 1)
            dp[i] = dp[i - 1] + 1;
        else if (v[i] == v[i - 1])
            dp[i] = dp[i - 1];
    }

    int idx = max_element(dp.begin(), dp.end()) - dp.begin();
    int sz = dp[idx];
    for (int i = 0;i < sz;i++)
        cout << (v[idx] - sz + i + 1) << ' ';
    cout << '\n';
}


int main()
{
    #ifndef DORMON
        ios_base::sync_with_stdio(false); 
    #endif
    cin.tie(0);
    int q = 1; 
    if (TEST_CASE) cin >> q;
    while (q--){
        solve();
    }
}