#include <bits/stdc++.h>
using ll = long long;
int main(){
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    ll n;
    std::cin >> n;
    std::vector<ll>a(n) , h;
    std::set<ll> s;
    for(int i = 0 ; i < n ; i++){
        std::cin >> a[i];
    }
    ll c = 0;
    for(int i = 0 ; i < n ; i++){
      if(i ==0){
        if(a[i] > a[i-1]){
            s.insert(a[i]);
        }
      }
      if(a[i] <a[i+1]){
        c++;
      }
      if(a[i] > a[i+1]){
        if(c!=0){
           s.insert(a[i-c +1]);
            c = 0;
        }
        else{
            continue;
        }
      }
    }
    std::cout << s.size() << "\n";
    for(int i : s){
        std::cout << i;
    }
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... |