Preparing for Merge Sort——动态规划优化

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·105) — the number of elements in Ivan’s array.

The second line contains a sequence consisting of distinct integers a1,?a2,?…,?an (1?≤?ai?≤?109) — 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.

Example
Input
5
1 3 2 5 4
Output
1 3 5
2 4
Input
4
4 3 2 1
Output
4
3
2
1
Input
4
10 30 50 101
Output
10 30 50 101

这道题类似导弹拦截，但是不能用那种一遍一遍找的方法，可以用vector做，但是我只用了动态规划
就是开一个结构体数组，设一个下标，表示a[i]是第几组的，从前往后，找到比他小的就放进去，否则就新开一个。

#include<iostream>
#include<algorithm>
using namespace std;
struct d
{
     int bh;
     int num;
}dp[200001];
int cmp(d a,d b)
{
     if(a.bh==b.bh)
     return a.num<b.num;
     return a.bh<b.bh;
}
int a[200001];
int main()
{
     int n;
     cin>>n;
     int k=1;
     for(int i=1;i<=n;i++)
     cin>>dp[i].num;
     for(int i=1;i<=n;i++)
     {
          if(dp[i].num<a[k])
          {
               a[++k]=dp[i].num;
               dp[i].bh=k;
          }
          else
          {
               for(int j=1;j<=k;j++)
               {
                    if(dp[i].num>a[j])
                    {
                         a[j]=dp[i].num;
                         dp[i].bh=j;
                         break;
                   }
               }
          }
     }
     sort(dp+1,dp+n+1,cmp);
     for(int i=1;i<=n;i++)
     {
        cout<<dp[i].num<<" ";
        if(dp[i].bh!=dp[i+1].bh)
            cout<<endl;
     }
 return 0;
}