結果

問題 No.209 Longest Mountain Subsequence
ユーザー uwiuwi
提出日時 2015-05-15 22:35:13
言語 Java21
(openjdk 21)
結果
AC  
実行時間 258 ms / 2,000 ms
コード長 3,746 bytes
コンパイル時間 3,896 ms
コンパイル使用メモリ 89,584 KB
実行使用メモリ 59,384 KB
最終ジャッジ日時 2024-07-06 04:06:47
合計ジャッジ時間 5,119 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 159 ms
56,960 KB
testcase_01 AC 240 ms
58,416 KB
testcase_02 AC 145 ms
56,672 KB
testcase_03 AC 258 ms
59,384 KB
testcase_04 AC 254 ms
59,364 KB
testcase_05 AC 147 ms
56,404 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest;

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class Q368 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		for(int T = ni();T >= 1;T--){
			int n = ni();
			int[] a = na(n);
			
			int[][] up = up(a);
			for(int p = 0, q = n-1;p < q;p++,q--){
				int d = a[p]; a[p] = a[q]; a[q] = d;
			}
			int[][] down = up(a);
			long ret = 1;
			for(int i = 0;i < n;i++){
				long left = Long.MIN_VALUE / 3;
				for(int j = 0;j < n;j++){
					left = Math.max(left, up[i][j]);
				}
				long right = Long.MIN_VALUE / 3;
				for(int j = 0;j < n;j++){
					right = Math.max(right, down[n-1-i][j]);
				}
				ret = Math.max(ret, left + right - 1);
			}
			out.println(ret);
		}
	}
	
	int[][] up(int[] a){
		int n = a.length;
		int[][] up = new int[n][n];
		for(int i = 0;i < n;i++){
			Arrays.fill(up[i], Integer.MIN_VALUE / 3);
		}
		for(int i = 0;i < n;i++){
			up[i][i] = 1;
			for(int j = 0;j < i;j++){
				for(int k = 0;k <= j;k++){
					if(a[i] > a[j] && a[j] >= a[k] && a[i]-a[j] > a[j]-a[k]){
						up[i][j] = Math.max(up[i][j], up[j][k] + 1);
					}
				}
			}
		}
		return up;
	}
	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
	}
	
	public static void main(String[] args) throws Exception { new Q368().run(); }
	
	private byte[] inbuf = new byte[1024];
	private int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private char[][] nm(int n, int m)
	{
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private int ni()
	{
		int num = 0, b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0