zoukankan      html  css  js  c++  java
  • Codeforces675D(SummerTrainingDay06-J)

    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 a1 becomes the root of the tree.
    2. Elements a2, a3, ..., an are added one by one. To add element ai 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 ai 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 ai 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 ai (1 ≤ ai ≤ 109) — 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 ai 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.

     1 //2017-09-05
     2 #include <cstdio>
     3 #include <cstring>
     4 #include <iostream>
     5 #include <algorithm>
     6 #include <map>
     7 #include <set>
     8 
     9 using namespace std;
    10 
    11 int n;
    12 map<int, int> pos;
    13 set<int> st;
    14 set<int>::iterator iter, it;
    15 
    16 int main()
    17 {
    18     std::ios::sync_with_stdio(false);
    19     cin.tie(0);
    20     freopen("inputJ.txt", "r", stdin);
    21     while(cin>>n){
    22         st.clear();
    23         pos.clear();
    24         int a;
    25         cin>>a;
    26         st.insert(a);
    27         st.insert(0);
    28         pos[a] = 1;
    29         for(int i = 2; i <= n; i++){
    30             cin>>a;
    31             iter = st.lower_bound(a);//返回第一个大于等于a的数
    32             it = iter;
    33             it--;//比a小的最大的数
    34             if(pos[*it] > pos[*iter])
    35                   cout<<*it<<" ";
    36             else cout<<*iter<<" ";
    37             pos[a] = i;
    38             st.insert(a);
    39         }
    40         cout<<endl;
    41     }
    42 
    43     return 0;
    44 }
  • 相关阅读:
    PC逆向之代码还原技术,第六讲汇编中除法代码还原以及原理第一讲,除数是2的幂
    PC逆向之代码还原技术,第五讲汇编中乘法的代码还原
    PC逆向之代码还原技术,第四讲汇编中减法的代码还原
    【Android】20.2 视频播放
    【Android】20.1 音频播放
    【Android】20.0 第20章 音频、视频、拍照、语音合成
    【Android】常见问题解答
    【Android】19.3 ContentProvider及安卓进一步封装后的相关类
    【Android】19.2 ShareActionProvider类—帮你把信息分享出去
    【Android】19.1 SharedPreferences类
  • 原文地址:https://www.cnblogs.com/Penn000/p/7479457.html
Copyright © 2011-2022 走看看