动态规划：What Goes Up

转：http://blog.youkuaiyun.com/kongming_acm/article/details/5725922

1263: What Goes Up

---

Result	TIME Limit	MEMORY Limit	Run Times	AC Times	JUDGE
	3s	8192K	896	219	Standard

Write a program that will select the longest strictly increasing subsequence from a sequence of integers.

Input

The input file will contain a sequence of integers (positive, negative, and/or zero). Each line of the input file will contain one integer.

Output

The output for this program will be a line indicating the length of the longest subsequence, a newline, a dash character ('-'), a newline, and then the subsequence itself printed with one integer per line. If the input contains more than one longest subsequence, the output file should print the one that occurs last in the input file.

 

Notice that the second 8 was not included -- the subsequence must be strictly increasing.

Sample Input

 

-7 10 9 2 3 8 8 6

Sample Output

 

4 - -7 2 3 6

 

 

package com.iteye.caoruntao.zoj;

import java.util.Scanner;

/**
 * @author caoruntao
 *
 */
public class WhatGoesUp {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		int n = 0;
		int a[] = new int[10000];
		int dp[] = new int[10000];
		dp[0] = 1;
		int pre[] = new int[10000];
		pre[0] = -1;
		int num[] = new int[10000];
		
		Scanner sc = new Scanner(System.in);
		while(sc.hasNextInt()){
			a[n++] = sc.nextInt();
		}
		sc.close();
		
		for(int i=0; i<n; i++){
			dp[i] = 1;
			pre[i] = -1;
			for(int j=0; j<i; j++){
				if(a[j] < a[i] && dp[i] <= dp[j]+1){
					dp[i] = dp[j]+1;
					pre[i] = j;
				}
			}
		}
		
		int maxLen = 0;
		int maxIndex = 0;
		for(int i=0; i<n; i++){
			if(maxLen < dp[i]){
				maxLen = dp[i];
				maxIndex = i;
			}
		}
		
		int l = 0;
		int k = maxIndex;
		while(k != -1){
			num[l++] = a[k];
			k = pre[k];
		}
		System.out.println(maxLen);
		System.out.println("-");
		for(int j=l-1; j>=0; j++){
			System.out.println(num[j]);
		}
	}

}