結果

問題 No.1247 ブロック登り
ユーザー uwiuwi
提出日時 2020-10-02 21:51:53
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,414 bytes
コンパイル時間 5,476 ms
コンパイル使用メモリ 91,984 KB
実行使用メモリ 480,436 KB
最終ジャッジ日時 2024-07-16 04:51:38
合計ジャッジ時間 35,497 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 56 ms
50,332 KB
testcase_01 WA -
testcase_02 WA -
testcase_03 AC 56 ms
49,932 KB
testcase_04 WA -
testcase_05 WA -
testcase_06 AC 56 ms
50,060 KB
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 AC 95 ms
53,428 KB
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest201002;
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 F {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), K = ni();
		int[] a = na(n);
		long[][][][] dp = new long[K+1][2][n][n];
		long I = Long.MIN_VALUE / 10;
		for(int i = 0;i <= K;i++){
			for(int j = 0;j < n;j++){
				Arrays.fill(dp[i][0][j], I);
				Arrays.fill(dp[i][1][j], I);
			}
		}
		for(int i = 0;i < n;i++){
			dp[K][0][i][i] = dp[K][1][i][i] = (long)K*a[i];
		}

		long[] maxs = new long[n];
		Arrays.fill(maxs, I);
		for(int k = K;k >= 0;k--){
			for(int len = 1;len <= n;len++){
				for(int i = 0;i+len-1 < n;i++){
					int j = i+len-1;
					if(i+k <= j){
						maxs[i+k] = Math.max(maxs[i+k], dp[k][0][i][j]);
					}
					if(j-k >= i){
						maxs[j-k] = Math.max(maxs[j-k], dp[k][1][i][j]);
					}
					{
						int nk = k-1;
						if(nk >= 0 && i-1 >= 0){
							dp[nk][0][i-1][j] = Math.max(dp[nk][0][i-1][j], dp[k][0][i][j] + (long)nk*a[i-1]);
						}
					}
					{
						int nk = k-1;
						if(nk >= 0 && j+1 < n){
							dp[nk][1][i][j+1] = Math.max(dp[nk][1][i][j+1], dp[k][1][i][j] + (long)nk*a[j+1]);
						}
					}
					{
						int nk = k-(j-i)-1;
						if(nk >= 0 && j+1 < n){
							dp[nk][1][i][j+1] = Math.max(dp[nk][1][i][j+1], dp[k][0][i][j] + (long)nk*a[j+1]);
						}
					}
					{
						int nk = k-(j-i)-1;
						if(nk >= 0 && i-1 >= 0){
							dp[nk][0][i-1][j] = Math.max(dp[nk][0][i-1][j], dp[k][1][i][j] + (long)nk*a[i-1]);
						}
					}
				}
			}
		}

		for(long v : maxs){
			out.println(v);
		}
	}
	
	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 F().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