Submission

Status:

PPPPPPPPPP

Subtask/Task Score:

100/100

Score: 100

User: faofao

Problemset: Consecutive Subsequence

Language: cpp

Time: 0.003 second

Submitted On: 2026-03-14 13:12:59

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

vector<int> v ;
map<int,int> mp ;

int main(){
    ios::sync_with_stdio(0),cin.tie(0) ;
    int x ;
    while(cin >> x){
        if(mp[x]==0) {
            v.push_back(x) ;
            mp[x]++ ;
        }
    }
    sort(v.begin(),v.end()) ;
    int n = v.size() ;

    int i=1 ;
    int mx=0 ;
    int l=0 ;
    int ct=0 ;
    int r=0 ;

    // for(int i=0 ; i<n ; i++){
    //     cout << v[i] << " " ;
    // }
    // cout << "\n" << "\n" ;

    while(i<n){
        int mem =v[i-1] ;
        ct=0 ;
        while(i<n && v[i] - v[i-1] == 1){
            // cout << v[i] << " " ;
            ct++ ;
            i++ ;
        }
        if(ct>mx){
            mx = ct ;
            l = mem ;
            r = v[i-1] ;
            // cout << "\n****" << l << " " << r << "\n"  ;
        }
        i++ ;
    }
    for(int i=l ; i<=r ; i++){
        cout << i << " " ;
    }
}