[HDU - 5748] Bellovin（动态规划&&LIS）

Link：http://acm.hdu.edu.cn/showproblem.php?pid=5748

Problem Description

Peter has a sequence a1,a2,…,an and he define a function on the sequence – F(a1,a2,…,an)=(f1,f2,…,fn), where fi is the length of the longest increasing subsequence ending with ai.

Peter would like to find another sequence b1,b2,…,bn in such a manner that F(a1,a2,…,an) equals to F(b1,b2,…,bn). Among all the possible sequences consisting of only positive integers, Peter wants the lexicographically smallest one.

The sequence a1,a2,…,an is lexicographically smaller than sequence b1,b2,…,bn, if there is such number i from 1 to n, that ak=bk for 1 ≤ k< i and ai < bi.

Input

There are multiple test cases. The first line of input contains an integer T, indicating the number of test cases. For each test case:

The first contains an integer n (1≤n≤100000) – the length of the sequence. The second line contains n integers a1,a2,…,an (1≤ai≤109).

Output

For each test case, output n integers b1,b2,…,bn (1≤bi≤109) denoting the lexicographically smallest sequence.

Sample Input

3
1
10
5
5 4 3 2 1
3
1 3 5

Sample Output

1
1 1 1 1 1
1 2 3

题解：

LIS的变形  求每第i个数之前的最长上升子序列个数

Code：

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#define INF 0x3f3f3f3f
using namespace std;
const int maxn=1e6+10;
long long a[maxn];
long long dp[maxn];
int main()
{
    int t,n;
    scanf("%d",&t);
    while(t--)
    {   
        scanf("%d",&n);
        for(int i=0;i<n;i++)
            dp[i]=INF;
        for(int i=0;i<n;i++)
        {
            scanf("%lld",&a[i]);
            *lower_bound(dp,dp+n,a[i])=a[i];
            long long l=lower_bound(dp,dp+n,a[i])-dp;//这里很怪  lower_bound里的value值改成INF的话就是不A
            printf("%lld%c",l+1,i==n-1? '\n':' ');
        }
    }
return 0;
}