結果

問題 No.324 落ちてた閉路グラフ
ユーザー uwiuwi
提出日時 2015-12-17 00:09:36
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,101 bytes
コンパイル時間 6,203 ms
コンパイル使用メモリ 77,292 KB
実行使用メモリ 238,532 KB
最終ジャッジ日時 2023-10-14 11:38:39
合計ジャッジ時間 11,079 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 44 ms
47,212 KB
testcase_01 AC 41 ms
49,116 KB
testcase_02 AC 40 ms
49,088 KB
testcase_03 AC 41 ms
49,252 KB
testcase_04 AC 417 ms
238,040 KB
testcase_05 AC 352 ms
238,212 KB
testcase_06 WA -
testcase_07 AC 351 ms
238,384 KB
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 AC 348 ms
238,304 KB
testcase_12 AC 306 ms
133,664 KB
testcase_13 WA -
testcase_14 AC 103 ms
61,204 KB
testcase_15 AC 188 ms
66,748 KB
testcase_16 AC 41 ms
49,084 KB
testcase_17 WA -
testcase_18 AC 40 ms
48,852 KB
testcase_19 AC 39 ms
49,312 KB
testcase_20 AC 41 ms
49,376 KB
testcase_21 AC 41 ms
49,284 KB
testcase_22 AC 40 ms
49,084 KB
testcase_23 AC 41 ms
49,304 KB
testcase_24 AC 41 ms
49,248 KB
testcase_25 AC 40 ms
49,080 KB
testcase_26 AC 40 ms
49,084 KB
testcase_27 WA -
testcase_28 AC 41 ms
48,968 KB
testcase_29 AC 42 ms
49,340 KB
testcase_30 AC 42 ms
48,976 KB
testcase_31 AC 41 ms
49,168 KB
testcase_32 AC 354 ms
238,208 KB
testcase_33 AC 351 ms
238,024 KB
testcase_34 WA -
testcase_35 AC 51 ms
49,192 KB
testcase_36 WA -
testcase_37 WA -
権限があれば一括ダウンロードができます

ソースコード

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 Adv17 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), m = ni();
		int[] w = na(n);
		
		int ret = -9999999;
		
		// include
		{
			int[][] dp = new int[n][n+1]; // last num
			int[][] maxs = new int[n][n+1];
			for(int i = 0;i < n;i++){
				Arrays.fill(dp[i], -9999999);
				Arrays.fill(maxs[i], -9999999);
			}
			dp[0][1] = 0;
			maxs[0][1] = 0;
			
			for(int i = 1;i < n;i++){
				for(int k = 1;k <= n;k++){
					int max = -9999999;
					if(i-2 >= 0)max = Math.max(max, maxs[i-2][k-1]);
					max = Math.max(max, dp[i-1][k-1] + w[i-1]);
					dp[i][k] = max;
					maxs[i][k] = Math.max(dp[i][k], maxs[i-1][k]);
				}
			}
			for(int i = 0;i < n-1;i++){
				ret = Math.max(ret, dp[i][m]);
			}
			ret = Math.max(ret, dp[n-1][m] + w[n-1]);
		}
		
		// not include
		{
			int[][] dp = new int[n][n+1]; // last num
			int[][] maxs = new int[n][n+1];
			for(int i = 0;i < n;i++){
				Arrays.fill(dp[i], -9999999);
				Arrays.fill(maxs[i], -9999999);
			}
			dp[0][0] = 0;
			maxs[0][0] = 0;
			
			for(int i = 1;i < n;i++){
				for(int k = 1;k <= n;k++){
					int max = -9999999;
					if(i-2 >= 0)max = Math.max(max, maxs[i-2][k-1]);
					max = Math.max(max, dp[i-1][k-1] + w[i-1]);
					dp[i][k] = max;
					maxs[i][k] = Math.max(dp[i][k], maxs[i-1][k]);
				}
			}
			for(int i = 0;i < n;i++){
				ret = Math.max(ret, dp[i][m]);
			}
		}
		out.println(ret);
	}
	
	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 Adv17().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