【杭电oj5748】Bellovin

                                              Bellovin

Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 1076    Accepted Submission(s): 485

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
  
  

 

Source

BestCoder Round #84

 

Recommend

wange2014   |   We have carefully selected several similar problems for you:   5831  5830  5829  5828  5827 

 思路：求到各个元素的最长上升子序列

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
const int N = 1e5+5;
int a[N],b[N],dp[N];
int find(int l,int r,int x) {
	while(l<=r) {
		int mid=l+r>>1;
		if(dp[mid]>x) r=mid-1;
		else if(dp[mid]<x) l=mid+1;
		else {
			l=mid;
			break;
		}
	}
	return l;
}
int main() {
	int T;
	scanf("%d",&T);
	while(T--) {
		int n;
		scanf("%d",&n);
		for(int i=0; i<n; i++) {
			scanf("%d",&a[i]);
		}
		int len=0;
		dp[0]=-1;
		for(int i=0; i<n; i++) {
			if(a[i]>dp[len]) {
				dp[++len]=a[i];
				b[i]=len;
			} else {
				int j=find(1,len,a[i]);
				b[i]=j;
				dp[j]=a[i];
			}
		}
		for(int i=0; i<n; i++) {
			if(!i)
				printf("%d",b[i]);
			else
				printf(" %d",b[i]);
		}
		printf("\n");
	}
	return 0;
}

题目地址：http://acm.hdu.edu.cn/showproblem.php?pid=5748