POJ1631最长单调递增子序列

最长单调递增子序列

import java.io.BufferedReader;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.StringTokenizer;

public class Main {
	public static void main(String[] args) {
		new Task().sovle();
	}
}

class Task {
	InputReader in = new InputReader(System.in);
	PrintWriter out = new PrintWriter(System.out);

	void sovle() {
	    int t = in.nextInt() ;
	    while(t-- > 0){
	    	int n = in.nextInt() ;
	    	int[] a = new int[n] ;
	    	for(int i = 0 ; i < n ; i++) a[i] = in.nextInt() ;
	    	int[] stack = new int[n] ;
	    	int top = -1 ;
	    	stack[++top] = a[0] ;
	    	for(int i = 1 ; i < n ; i++){
	    		if(a[i] > stack[top]) stack[++top] = a[i] ;
	    		else{
	    			int l = 0 , r = top , idx = -1 ;
	    			while(l <= r){
	    				int mid = (l + r) >> 1 ;
	    			    if(stack[mid] >= a[i]){
	    			    	r = mid - 1 ;
	    			    	idx = mid ;
	    			    }
	    			    else l = mid + 1 ;
	    			}
	    			stack[idx] = a[i] ;
	    		}
	    	}
	    	out.println(top+1) ;
	    }
		out.flush() ;
	}
}

class InputReader {
	public BufferedReader reader;
	public StringTokenizer tokenizer;

	public InputReader(InputStream stream) {
		reader = new BufferedReader(new InputStreamReader(stream), 32768);
		tokenizer = new StringTokenizer("");
	}

	private void eat(String s) {
		tokenizer = new StringTokenizer(s);
	}

	public String nextLine() {
		try {
			return reader.readLine();
		} catch (Exception e) {
			return null;
		}
	}

	public boolean hasNext() {
		while (!tokenizer.hasMoreTokens()) {
			String s = nextLine();
			if (s == null)
				return false;
			eat(s);
		}
		return true;
	}

	public String next() {
		hasNext();
		return tokenizer.nextToken();
	}

	public int nextInt() {
		return Integer.parseInt(next());
	}

	public long nextLong() {
		return Long.parseLong(next());
	}

	public double nextDouble() {
		return Double.parseDouble(next());
	}

	public BigInteger nextBigInteger() {
		return new BigInteger(next());
	}

}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值