#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define rep(x, s, t) for(ll x = (s); (x) <= (t); (x)++) #define per(x, s, t) for(ll x = (s); (x) >= (t); (x)--) #define reps(x, s) for(ll x = 0; (x) < (ll)(s).size(); (x)++) #define chmin(x, y) (x) = min((x), (y)) #define chmax(x, y) (x) = max((x), (y)) #define sz(x) ((ll)(x).size()) #define all(x) (x).begin(),(x).end() #define outl(...) dump_func(__VA_ARGS__) #define outf(x) cout << fixed << setprecision(16) << (x) << endl #define pb push_back #define fst first #define snd second #define inf 2e18 #define eps 1e-9 const double PI = 3.1415926535897932384626433; using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair P; struct edge{ ll to, cost; edge(){} edge(ll a, ll b){ to = a, cost = b;} }; const int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1}; int mod = 100; //const int mod = 1000000007; //const int mod = 998244353; struct mint{ int x; mint(ll y = 0){if(y < 0 || y >= mod) y = (y%mod+mod)%mod; x = y;} mint(const mint &ope) {x = ope.x;} mint operator-(){return mint(-x);} mint operator+(const mint &ope){return mint(x) += ope;} mint operator-(const mint &ope){return mint(x) -= ope;} mint operator*(const mint &ope){return mint(x) *= ope;} mint operator/(const mint &ope){return mint(x) /= ope;} mint& operator+=(const mint &ope){x += ope.x; if(x >= mod) x -= mod; return *this;} mint& operator-=(const mint &ope){x += mod - ope.x; if(x >= mod) x -= mod; return *this;} mint& operator*=(const mint &ope){ll tmp = x; tmp *= ope.x, tmp %= mod; x = tmp; return *this;} mint& operator/=(const mint &ope){ ll n = mod-2; mint mul = ope; while(n){if(n & 1) *this *= mul; mul *= mul; n >>= 1;} return *this; } mint inverse(){return mint(1) / *this;} bool operator ==(const mint &ope){return x == ope.x;} bool operator !=(const mint &ope){return x != ope.x;} bool operator <(const mint &ope)const{return x < ope.x;} }; mint modpow(mint a, ll n){ if(n == 0) return mint(1); if(n % 2) return a * modpow(a, n-1); else return modpow(a*a, n/2); } istream& operator >>(istream &is, mint &ope){ll t; is >> t, ope.x = t; return is;} ostream& operator <<(ostream &os, mint &ope){return os << ope.x;} ostream& operator <<(ostream &os, const mint &ope){return os << ope.x;} ll modpow(ll a, ll n, ll mod){ if(n == 0) return 1; if(n % 2) return ((a%mod) * (modpow(a, n-1, mod)%mod)) % mod; else return modpow((a*a)%mod, n/2, mod) % mod; } vector fact, fact_inv; void make_fact(int n){ fact.resize(n+1), fact_inv.resize(n+1); fact[0] = mint(1); rep(i, 1, n) fact[i] = fact[i-1] * mint(i); fact_inv[n] = fact[n].inverse(); per(i, n-1, 0) fact_inv[i] = fact_inv[i+1] * mint(i+1); } mint comb(int n, int k){ if(n < 0 || k < 0 || n < k) return mint(0); return fact[n] * fact_inv[k] * fact_inv[n-k];} mint perm(int n, int k){ return comb(n, k) * fact[k]; } vector prime, pvec, qrime; void make_prime(int n){ prime.resize(n+1); rep(i, 2, n){ if(prime[i] == 0) pvec.push_back(i), prime[i] = i; for(auto p : pvec){ if(i*p > n || p > prime[i]) break; prime[i*p] = p;} } } void make_qrime(int n){ qrime.resize(n+1); rep(i, 2, n){int ni = i / prime[i]; if(prime[i] == prime[ni]) qrime[i] = qrime[ni] * prime[i]; else qrime[i] = prime[i];} } bool exceed(ll x, ll y, ll m){return x >= m / y + 1;} void mark(){ cout << "*" << endl; } void yes(){ cout << "YES" << endl; } void no(){ cout << "NO" << endl; } ll floor(ll a, ll b){ if(b < 0) a *= -1, b *= -1; if(a >= 0) return a/b; else return -((-a+b-1)/b); } ll ceil(ll a, ll b){ if(b < 0) a *= -1, b *= -1; if(a >= 0) return (a+b-1)/b; else return -((-a)/b); } ll modulo(ll a, ll b){ b = abs(b); return a - floor(a, b) * b;} ll sgn(ll x){ if(x > 0) return 1; if(x < 0) return -1; return 0;} ll gcd(ll a, ll b){if(b == 0) return a; return gcd(b, a%b);} ll lcm(ll a, ll b){return a/gcd(a, b)*b;} ll arith(ll x){return x*(x+1)/2;} ll arith(ll l, ll r){return arith(r) - arith(l-1);} ll digitnum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret++; return ret;} ll digitsum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret += x % b; return ret;} string lltos(ll x){string ret; for(;x;x/=10) ret += x % 10 + '0'; reverse(all(ret)); return ret;} ll stoll(string &s){ll ret = 0; for(auto c : s) ret *= 10, ret += c - '0'; return ret;} template void uniq(T &vec){sort(all(vec)); vec.erase(unique(all(vec)), vec.end());} int popcount(ull x){ x -= ((x>>1)&0x5555555555555555ULL), x = (x & 0x3333333333333333ULL) + ((x>>2) & 0x3333333333333333ULL); return (((x + (x>>4)) & 0x0F0F0F0F0F0F0F0FULL) * 0x0101010101010101ULL) >> 56; } template pair& operator+=(pair &s, const pair &t){s.first += t.first, s.second += t.second; return s;} template pair& operator-=(pair &s, const pair &t){s.first -= t.first, s.second -= t.second; return s;} template pair operator+(const pair &s, const pair &t){return pair(s.first+t.first, s.second+t.second);} template pair operator-(const pair &s, const pair &t){return pair(s.first-t.first, s.second-t.second);} template T dot(const pair &s, const pair &t){return s.first*t.first + s.second*t.second;} template T cross(const pair &s, const pair &t){return s.first*t.second - s.second*t.first;} template ostream& operator << (ostream& os, vector& vec){reps(i, vec) os << vec[i] << " "; return os;} template ostream& operator << (ostream& os, const vector& vec){reps(i, vec) os << vec[i] << " "; return os;} template ostream& operator << (ostream& os, deque& deq){reps(i, deq) os << deq[i] << " "; return os;} template ostream& operator << (ostream& os, pair& ope){ os << "(" << ope.first << ", " << ope.second << ")"; return os;} template ostream& operator << (ostream& os, const pair& ope){ os << "(" << ope.first << ", " << ope.second << ")"; return os;} template ostream& operator << (ostream& os, map& ope){ for(auto p : ope) os << "(" << p.first << ", " << p.second << "),";return os;} template ostream& operator << (ostream& os, set& ope){for(auto x : ope) os << x << " "; return os;} template ostream& operator << (ostream& os, multiset& ope){for(auto x : ope) os << x << " "; return os;} template void outa(T a[], ll s, ll t){rep(i, s, t){ cout << a[i]; if(i < t) cout << " ";} cout << endl;} void dump_func(){cout << endl;} template void dump_func(Head &&head, Tail &&... tail){cout << head; if(sizeof...(Tail) > 0) cout << " "; dump_func(std::move(tail)...);} struct SegTree{ typedef ll SEG; int size; vector seg; SegTree(){} SegTree(int size){ this->size = size; seg.resize(1<<(size+1)); } SEG Ident(){ //identity element return -inf; } SEG ope(SEG a, SEG b){ //operator return max(a, b); } void init(){ for(int i = 0; i < (1<<(size+1)); i++) seg[i] = Ident(); } void update(int i, SEG val){ i += (1 << size); seg[i] = val; while(i > 1){ i /= 2; seg[i] = ope(seg[i*2], seg[i*2+1]); } } SEG query(int a, int b, int k, int l, int r){ if(b < l || r < a) return Ident(); if(a <= l && r <= b) return seg[k]; SEG lval = query(a, b, k*2, l, (l+r)/2); SEG rval = query(a, b, k*2+1, (l+r)/2+1, r); return ope(lval, rval); } SEG query(int a, int b){ if(a > b) return Ident(); return query(a, b, 1, 0, (1< seg; SegTree2(){} SegTree2(int size){ this->size = size; seg.resize(1<<(size+1)); } SEG Ident(){ //identity element return 0; } SEG ope(SEG a, SEG b){ //operator return a+b; } void init(){ for(int i = 0; i < (1<<(size+1)); i++) seg[i] = Ident(); } void update(int i, SEG val){ i += (1 << size); seg[i] = val; while(i > 1){ i /= 2; seg[i] = ope(seg[i*2], seg[i*2+1]); } } SEG query(int a, int b, int k, int l, int r){ if(b < l || r < a) return Ident(); if(a <= l && r <= b) return seg[k]; SEG lval = query(a, b, k*2, l, (l+r)/2); SEG rval = query(a, b, k*2+1, (l+r)/2+1, r); return ope(lval, rval); } SEG query(int a, int b){ if(a > b) return Ident(); return query(a, b, 1, 0, (1< vec[300005], vec2[300005]; ll len; mint ep[300005], ep2[300005]; void calc(ll m) { mod = m; mint all; SegTree2 seg(19); seg.init(); ep[0] = 1; rep(i, 1, n){ vector

tmp; for(auto x : vec[i-1]) tmp.pb(P(p[x], x)); for(auto x : vec[i]) tmp.pb(P(p[x], x)); sort(all(tmp)); for(auto p : tmp){ ll x = p.snd; if(dp[x] == i-1) seg.update(x, ep[x]); else ep[x] = seg.query(0, x-1); } if(i == len+1) all = seg.query(0, n+1); for(auto p : tmp) if(dp[p.snd] == i-1) seg.update(p.snd, 0); } ep2[n+1] = 1; rep(i, 1, n){ vector

tmp; for(auto x : vec2[i-1]) tmp.pb(P(p[x], x)); for(auto x : vec2[i]) tmp.pb(P(p[x], x)); sort(all(tmp)), reverse(all(tmp)); //outl(tmp); for(auto p : tmp){ ll x = p.snd; if(dp2[x] == i-1) seg.update(x, ep2[x]); else ep2[x] = seg.query(x+1, n+1); } for(auto p : tmp) if(dp2[p.snd] == i-1) seg.update(p.snd, 0); } /*outa(ep, 0, n+1); outa(ep2, 0, n+1); outl(all);*/ rep(i, 1, n){ if(ep[i] * ep2[i] != all) b[i] = false; } } int main(void) { ios::sync_with_stdio(0); cin.tie(0); cin >> n; rep(i, 1, n) cin >> p[i]; rep(i, 1, n) q[p[i]] = i; p[n+1] = n+1; seg.init(); dp[0] = 0, seg.update(0, 0); rep(i, 1, n){ dp[q[i]] = seg.query(0, q[i]-1)+1; seg.update(q[i], dp[q[i]]); } rep(i, 0, n) vec[dp[i]].pb(i); seg2.init(); dp2[n+1] = 0, seg2.update(n+1, 0); per(i, n, 1){ dp2[q[i]] = seg2.query(q[i]+1, n+1)+1; seg2.update(q[i], dp2[q[i]]); } rep(i, 1, n+1) vec2[dp2[i]].pb(i); rep(i, 0, n+1) reverse(all(vec2[i])); len = seg.query(1, n); /*outa(dp, 0, n+1); outa(dp2, 0, n+1); outl(len);*/ rep(i, 1, n) b[i] = (len == dp[i]+dp2[i]-1); ll a[] = {950009857, 943718401, 935329793}; rep(i, 0, 2) calc(a[i]); vector ans; rep(i, 1, n) if(b[i]) ans.pb(p[i]); outl(sz(ans)); outl(ans); return 0; }