結果

問題 No.335 門松宝くじ
ユーザー uwiuwi
提出日時 2016-01-15 22:52:13
言語 Java21
(openjdk 21)
結果
AC  
実行時間 141 ms / 2,000 ms
コード長 4,424 bytes
コンパイル時間 3,440 ms
コンパイル使用メモリ 89,068 KB
実行使用メモリ 40,812 KB
最終ジャッジ日時 2024-09-19 19:21:32
合計ジャッジ時間 5,327 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 48 ms
37,104 KB
testcase_01 AC 44 ms
37,372 KB
testcase_02 AC 46 ms
37,132 KB
testcase_03 AC 44 ms
36,660 KB
testcase_04 AC 46 ms
36,940 KB
testcase_05 AC 95 ms
39,028 KB
testcase_06 AC 82 ms
38,748 KB
testcase_07 AC 120 ms
40,004 KB
testcase_08 AC 97 ms
39,780 KB
testcase_09 AC 131 ms
40,024 KB
testcase_10 AC 139 ms
40,628 KB
testcase_11 AC 140 ms
40,748 KB
testcase_12 AC 141 ms
40,812 KB
testcase_13 AC 135 ms
39,788 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 Q936 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), m = ni();
		long maxsum = -1;
		int argmax = -1;
		for(int i = 0;i < m;i++){
			int[] a = na(n);
			long sum = 0;
			int[] minleft = new int[n];
			int[] maxleft = new int[n];
			int[] minright = new int[n];
			int[] maxright = new int[n];
			Arrays.fill(minleft, 99999);
			Arrays.fill(minright, 99999);
			Arrays.fill(maxleft, -1);
			Arrays.fill(maxright, -1);
			minleft[0] = a[0];
			maxleft[0] = a[0];
			for(int j = 1;j < n;j++){
				minleft[j] = Math.min(minleft[j-1], a[j]);
				maxleft[j] = Math.max(maxleft[j-1], a[j]);
			}
			minright[n-1] = a[n-1];
			maxright[n-1] = a[n-1];
			for(int j = n-2;j >= 0;j--){
				minright[j] = Math.min(minright[j+1], a[j]);
				maxright[j] = Math.max(maxright[j+1], a[j]);
			}
			
			for(int j = 0;j < n;j++){
				int max = -1;
				int min = 999;
				for(int k = j+2;k < n;k++){
					max = Math.max(max, a[k-1]);
					min = Math.min(min, a[k-1]);
					int val = 0;
					if(a[j] < a[k]){
						if(j-1 >= 0 && maxleft[j-1] > a[j]){
							val = Math.max(val, Math.max(maxleft[j-1], a[k]));
						}
						if(k+1 < n && minright[k+1] < a[k]){
							val = Math.max(val, a[k]);
						}
					}else{
						if(j-1 >= 0 && minleft[j-1] < a[j]){
							val = Math.max(val, a[j]);
						}
						if(k+1 < n && maxright[k+1] > a[j]){
							val = Math.max(val, Math.max(maxright[k+1], a[j]));
						}
					}
					
					if(a[j] < max && max > a[k]){
						val = Math.max(val, max);
					}else if(a[j] > min && min < a[k]){
						val = Math.max(val, Math.max(a[j], a[k]));
					}
					sum += val;
				}
			}
			if(sum > maxsum){
				maxsum = sum;
				argmax = i;
			}
		}
		out.println(argmax);
	}
	
	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 Q936().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