結果

問題 No.1174 盆栽の剪定
ユーザー uwiuwi
提出日時 2020-08-20 03:58:23
言語 Java21
(openjdk 21)
結果
AC  
実行時間 219 ms / 2,000 ms
コード長 3,634 bytes
コンパイル時間 3,707 ms
コンパイル使用メモリ 86,352 KB
実行使用メモリ 84,628 KB
最終ジャッジ日時 2024-10-12 16:51:39
合計ジャッジ時間 8,215 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 45 ms
50,220 KB
testcase_01 AC 46 ms
50,328 KB
testcase_02 AC 46 ms
50,172 KB
testcase_03 AC 46 ms
50,232 KB
testcase_04 AC 46 ms
49,964 KB
testcase_05 AC 45 ms
50,208 KB
testcase_06 AC 48 ms
50,440 KB
testcase_07 AC 46 ms
49,984 KB
testcase_08 AC 44 ms
50,208 KB
testcase_09 AC 44 ms
49,908 KB
testcase_10 AC 46 ms
50,352 KB
testcase_11 AC 45 ms
50,328 KB
testcase_12 AC 47 ms
50,448 KB
testcase_13 AC 46 ms
50,284 KB
testcase_14 AC 45 ms
50,316 KB
testcase_15 AC 46 ms
49,904 KB
testcase_16 AC 47 ms
50,056 KB
testcase_17 AC 45 ms
50,456 KB
testcase_18 AC 47 ms
49,988 KB
testcase_19 AC 178 ms
84,628 KB
testcase_20 AC 219 ms
78,004 KB
testcase_21 AC 84 ms
46,100 KB
testcase_22 AC 170 ms
74,976 KB
testcase_23 AC 157 ms
75,020 KB
testcase_24 AC 171 ms
74,768 KB
testcase_25 AC 145 ms
65,644 KB
testcase_26 AC 148 ms
65,808 KB
testcase_27 AC 137 ms
65,848 KB
testcase_28 AC 169 ms
74,876 KB
testcase_29 AC 128 ms
57,132 KB
testcase_30 AC 171 ms
74,880 KB
testcase_31 AC 131 ms
57,116 KB
testcase_32 AC 135 ms
56,396 KB
testcase_33 AC 144 ms
65,848 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package no1xxx;
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 No1174 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	long g(long[] a, int ind)
	{
		return ind >= 0 && ind < a.length ? a[ind] : 0;
	}
	
	void solve()
	{
		int n = ni();
		int[] a = na(n);
		int O = 20;
		long[][] dp = new long[n][2*O+1];
		for(int i = n-1;i >= 0;i--){
			for(int j = 1;j < 2*O;j++){
				{
					long lans = (long)a[i] * (j-O);
					if(2*i+1 < n)lans += dp[2*i+1][j-1];
					if(2*i+2 < n)lans += dp[2*i+2][j+1];
					dp[i][j] = Math.max(lans, dp[i][j]);
				}
				{
					long lans = (long)a[i] * (j-O);
					if(2*i+1 < n)lans += dp[2*i+1][j+1];
					if(2*i+2 < n)lans += dp[2*i+2][j-1];
					dp[i][j] = Math.max(lans, dp[i][j]);
				}
			}
		}
		out.println(dp[0][O]);
	}
	
	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 No1174().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