結果

問題 No.484 収穫
ユーザー uwiuwi
提出日時 2017-02-10 22:50:05
言語 Java21
(openjdk 21)
結果
AC  
実行時間 889 ms / 3,000 ms
コード長 4,036 bytes
コンパイル時間 4,088 ms
コンパイル使用メモリ 82,396 KB
実行使用メモリ 133,852 KB
最終ジャッジ日時 2023-08-03 16:17:03
合計ジャッジ時間 15,403 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 41 ms
49,172 KB
testcase_01 AC 41 ms
49,288 KB
testcase_02 AC 41 ms
49,328 KB
testcase_03 AC 41 ms
49,444 KB
testcase_04 AC 41 ms
49,284 KB
testcase_05 AC 41 ms
49,372 KB
testcase_06 AC 42 ms
49,360 KB
testcase_07 AC 41 ms
49,168 KB
testcase_08 AC 42 ms
49,212 KB
testcase_09 AC 79 ms
52,308 KB
testcase_10 AC 82 ms
52,488 KB
testcase_11 AC 80 ms
52,104 KB
testcase_12 AC 871 ms
133,400 KB
testcase_13 AC 854 ms
133,424 KB
testcase_14 AC 863 ms
133,272 KB
testcase_15 AC 860 ms
133,348 KB
testcase_16 AC 854 ms
133,584 KB
testcase_17 AC 889 ms
132,728 KB
testcase_18 AC 888 ms
132,676 KB
testcase_19 AC 867 ms
133,728 KB
testcase_20 AC 851 ms
133,852 KB
testcase_21 AC 851 ms
133,552 KB
testcase_22 AC 856 ms
133,488 KB
testcase_23 AC 835 ms
132,988 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest170210;
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 E {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	long[][][] dp;
	
	void solve()
	{
		int n = ni();
		int[] a = na(n);
		int maxa = 0;
		for(int i = 0;i < n;i++){
			maxa = Math.max(maxa, a[i]);
		}
		dp = new long[2][n][n];
		long low = maxa-1, high = maxa + 3000;
		while(high-low > 1){
			long h = high+low>>1;
			if(ok(h, a)){
				high = h;
			}else{
				low = h;
			}
		}
		out.println(high);
	}
	
	boolean ok(long h, int[] a)
	{
		int n = a.length;
		long I = -Long.MAX_VALUE / 2;
		for(int len = 1;len <= n;len++){
			for(int i = 0;i+len-1 < n;i++){
				int j = i+len-1;
				if(len == 1){
					dp[0][i][j] = h;
					dp[1][i][j] = h;
					if(dp[0][i][j] < a[i]){
						dp[0][i][j] = I;
					}
					if(dp[1][i][j] < a[i]){
						dp[1][i][j] = I;
					}
				}else{
					dp[0][i][j] = Math.max(dp[0][i+1][j]-1, dp[1][i+1][j] - (j-i));
					dp[1][i][j] = Math.max(dp[0][i][j-1]-(j-i), dp[1][i][j-1]-1);
					if(dp[0][i][j] < a[i]){
						dp[0][i][j] = I;
					}
					if(dp[1][i][j] < a[j]){
						dp[1][i][j] = I;
					}
				}
			}
		}
		return dp[0][0][n-1] >= 0 || dp[1][0][n-1] >= 0;
	}
	
	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");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new E().run(); }
	
	private byte[] inbuf = new byte[1024];
	public 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 int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	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[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	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