Codeforces 675D Tree Construction【思维+set】

D. Tree Construction

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

During the programming classes Vasya was assigned a difficult problem. However, he doesn't know how to code and was unable to find the solution in the Internet, so he asks you to help.

You are given a sequence a, consisting of n distinct integers, that is used to construct the binary search tree. Below is the formal description of the construction process.

1. First element a₁ becomes the root of the tree.
2. Elements a₂, a₃, ..., a_n are added one by one. To add element a_i one needs to traverse the tree starting from the root and using the following rules:
   1. The pointer to the current node is set to the root.
   2. If a_i is greater than the value in the current node, then its right child becomes the current node. Otherwise, the left child of the current node becomes the new current node.
   3. If at some point there is no required child, the new node is created, it is assigned value a_i and becomes the corresponding child of the current node.

Input

The first line of the input contains a single integer n (2 ≤ n ≤ 100 000) — the length of the sequence a.

The second line contains n distinct integers a_i (1 ≤ a_i ≤ 10⁹) — the sequence a itself.

Output

Output n - 1 integers. For all i > 1 print the value written in the node that is the parent of the node with value a_i in it.

Examples

Input

3
1 2 3

Output

1 2

Input

5
4 2 3 1 6

Output

4 2 2 4

Note

Picture below represents the tree obtained in the first sample.

Picture below represents the tree obtained in the second sample.

题目大意：

让你构造出来一颗二叉搜索树，问你每个点的父亲节点的数值是多少。

思路：

新加进来的点，其父亲要么是比他大的值中最小的，或者是比他小的值中的最大的。

那么这里维护一个set乱搞就行了。

set.lower_bound（val）查询的是比val值大于等于的第一个值。

Ac代码（参考自：http://blog.csdn.net/Yukizzz/article/details/51438061）（不会用set党表示慢慢接触慢慢了解）：

#include<stdio.h>
#include<set>
#include<iostream>
#include<algorithm>
#include<string.h>
#include<map>
using namespace std;
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        map<int ,int>lson,rson;
        set<int >s;
        set<int >::iterator pos;
        for(int i=0;i<n;i++)
        {
            int x;
            scanf("%d",&x);
            if(i==0)
            {
                s.insert(x);
                continue;
            }
            pos=s.lower_bound(x);
            if(pos!=s.end()&&lson[*pos]==0)
            {
                lson[*pos]=x;
            }
            else
            {
                pos--;
                rson[*pos]=x;
            }
            printf("%d ",*pos);
            s.insert(x);
        }
        printf("\n");
    }
}