codeforce 847B Preparing for Merge Sort

题目链接：点击打开链接

B. Preparing for Merge Sort

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Ivan has an array consisting of n different integers. He decided to reorder all elements in increasing order. Ivan loves merge sort so he decided to represent his array with one or several increasing sequences which he then plans to merge into one sorted array.

Ivan represent his array with increasing sequences with help of the following algorithm.

While there is at least one unused number in array Ivan repeats the following procedure:

• iterate through array from the left to the right;
• Ivan only looks at unused numbers on current iteration;
• if current number is the first unused number on this iteration or this number is greater than previous unused number on current iteration, then Ivan marks the number as used and writes it down.

For example, if Ivan's array looks like [1, 3, 2, 5, 4] then he will perform two iterations. On first iteration Ivan will use and write numbers[1, 3, 5], and on second one — [2, 4].

Write a program which helps Ivan and finds representation of the given array with one or several increasing sequences in accordance with algorithm described above.

Input

The first line contains a single integer n (1 ≤ n ≤ 2·10⁵) — the number of elements in Ivan's array.

The second line contains a sequence consisting of distinct integers a₁, a₂, ..., a_n (1 ≤ a_i ≤ 10⁹) — Ivan's array.

Output

Print representation of the given array in the form of one or more increasing sequences in accordance with the algorithm described above. Each sequence must be printed on a new line.

Examples

Input

51 3 2 5 4

Output

1 3 5 2 4 

Input

44 3 2 1

Output

4 3 2 1 

Input

410 30 50 101

Output

10 30 50 101 

方法：二分，暴力超时，二分思路比较巧妙

#include<stdio.h>#include<string.h>#include<algorithm>#include<vector>using namespace std;const int N=2e5+5;int a[N],b[N];vector<int>vee[N];int serch(int l,int r,int x){    while(l<r)    {        int mid=l+(r-l)/2;        if(b[mid]>=x)            r=mid;        else            l=mid+1;    }    return l-1;}int main(){    int n;    scanf("%d",&n);    for(int i=0;i<n;i++)    {        scanf("%d",&a[i]);        int pos=serch(0,n,a[i]);        b[pos]=a[i];        vee[pos].push_back(a[i]);    }    for(int i=n-1;i>=0;i--)    {        for(int j=0;j<vee[i].size();j++)        {            if(j==vee[i].size()-1)                printf("%d\n",vee[i][j]);            else                printf("%d ",vee[i][j]);        }    }}//直接用函数#include<stdio.h>#include<string.h>#include<algorithm>#include<algorithm>#include<vector>using namespace std;const int maxn = 1e5 + 5;int a[2 * maxn],b[2 * maxn];vector<int>G[2 * maxn];int main(){    int n;    scanf("%d",&n);    for(int i = 0;i < n;i++){        scanf("%d",&a[i]);        int pos = lower_bound(b,b + n,a[i]) - b;        pos--;        b[pos] = a[i];        G[pos].push_back(a[i]);    }    for(int i = n-1;i >= 0;i--){        for(int j = 0;j < G[i].size();j++){            if(j == G[i].size() - 1) printf("%d\n",G[i][j]);            else printf("%d ",G[i][j]);        }    }}