結果

問題 No.324 落ちてた閉路グラフ
ユーザー uwiuwi
提出日時 2015-12-17 01:32:01
言語 Java21
(openjdk 21)
結果
AC  
実行時間 182 ms / 5,000 ms
コード長 4,497 bytes
コンパイル時間 4,554 ms
コンパイル使用メモリ 81,720 KB
実行使用メモリ 40,288 KB
最終ジャッジ日時 2024-11-15 19:27:39
合計ジャッジ時間 9,375 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 53 ms
36,952 KB
testcase_01 AC 54 ms
36,464 KB
testcase_02 AC 54 ms
36,908 KB
testcase_03 AC 53 ms
36,708 KB
testcase_04 AC 179 ms
38,400 KB
testcase_05 AC 177 ms
40,184 KB
testcase_06 AC 179 ms
40,076 KB
testcase_07 AC 179 ms
40,256 KB
testcase_08 AC 180 ms
38,476 KB
testcase_09 AC 181 ms
38,444 KB
testcase_10 AC 181 ms
38,204 KB
testcase_11 AC 180 ms
40,288 KB
testcase_12 AC 54 ms
36,864 KB
testcase_13 AC 121 ms
37,992 KB
testcase_14 AC 96 ms
38,168 KB
testcase_15 AC 99 ms
38,220 KB
testcase_16 AC 52 ms
36,800 KB
testcase_17 AC 55 ms
36,880 KB
testcase_18 AC 54 ms
37,004 KB
testcase_19 AC 54 ms
37,044 KB
testcase_20 AC 52 ms
36,864 KB
testcase_21 AC 52 ms
36,996 KB
testcase_22 AC 53 ms
36,596 KB
testcase_23 AC 53 ms
36,932 KB
testcase_24 AC 52 ms
36,908 KB
testcase_25 AC 53 ms
36,940 KB
testcase_26 AC 54 ms
36,784 KB
testcase_27 AC 53 ms
36,780 KB
testcase_28 AC 52 ms
36,880 KB
testcase_29 AC 52 ms
36,920 KB
testcase_30 AC 55 ms
36,940 KB
testcase_31 AC 55 ms
36,848 KB
testcase_32 AC 182 ms
38,192 KB
testcase_33 AC 177 ms
40,196 KB
testcase_34 AC 152 ms
38,304 KB
testcase_35 AC 60 ms
36,752 KB
testcase_36 AC 133 ms
38,316 KB
testcase_37 AC 56 ms
36,468 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 Adv17F {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), m = ni();
		int[] w = na(n);
		if(m == 0){
			out.println(0);
			return;
		}
		
		int ret = -9999999;
		
		// include
		{
			int[] pre = new int[n+1];
			int[] cur = new int[n+1];
			int[] pprem = new int[n+1];
			int[] prem = new int[n+1];
			int[] curm = new int[n+1];
			Arrays.fill(pre, -9999999);
			Arrays.fill(cur, -9999999);
			Arrays.fill(pprem, -9999999);
			Arrays.fill(prem, -9999999);
			Arrays.fill(curm, -9999999);
			pre[1] = 0;
			prem[1] = 0;
			
			for(int i = 1;i < n;i++){
				for(int k = 1;k <= n;k++){
					int max = pprem[k-1];
					if(k > 1){
						max = Math.max(max, pre[k-1] + w[i-1]);
					}else{
//						max = Math.max(max, 0);
					}
					cur[k] = max;
					curm[k] = Math.max(cur[k], prem[k]);
				}
				{int[] dum = pre; pre = cur; cur = dum;}
				{int[] dum = pprem; pprem = prem; prem = curm; curm = dum;}
			}
			ret = Math.max(ret, pprem[m]);
			ret = Math.max(ret, pre[m] + w[n-1]);
		}
		
		// not include
		{
			int[] pre = new int[n+1];
			int[] cur = new int[n+1];
			int[] pprem = new int[n+1];
			int[] prem = new int[n+1];
			int[] curm = new int[n+1];
			Arrays.fill(pre, -9999999);
			Arrays.fill(cur, -9999999);
			Arrays.fill(pprem, -9999999);
			Arrays.fill(prem, -9999999);
			Arrays.fill(curm, -9999999);
			
			for(int i = 1;i < n;i++){
				for(int k = 1;k <= n;k++){
					int max = pprem[k-1];
					if(k > 1){
						max = Math.max(max, pre[k-1] + w[i-1]);
					}else{
						max = Math.max(max, 0);
					}
					cur[k] = max;
					curm[k] = Math.max(cur[k], prem[k]);
				}
				{int[] dum = pre; pre = cur; cur = dum;}
				{int[] dum = pprem; pprem = prem; prem = curm; curm = dum;}
			}
			ret = Math.max(prem[m], ret);
		}
		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 Adv17F().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