結果

問題 No.505 カードの数式2
ユーザー hiromi_ayasehiromi_ayase
提出日時 2017-04-21 22:54:00
言語 Java21
(openjdk 21)
結果
RE  
実行時間 -
コード長 3,860 bytes
コンパイル時間 2,111 ms
コンパイル使用メモリ 77,836 KB
実行使用メモリ 37,064 KB
最終ジャッジ日時 2024-07-20 06:28:14
合計ジャッジ時間 4,588 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 RE -
testcase_01 AC 47 ms
36,452 KB
testcase_02 AC 46 ms
36,744 KB
testcase_03 AC 47 ms
36,644 KB
testcase_04 RE -
testcase_05 AC 47 ms
36,452 KB
testcase_06 AC 47 ms
36,852 KB
testcase_07 RE -
testcase_08 AC 45 ms
36,792 KB
testcase_09 RE -
testcase_10 WA -
testcase_11 WA -
testcase_12 RE -
testcase_13 RE -
testcase_14 WA -
testcase_15 RE -
testcase_16 RE -
testcase_17 WA -
testcase_18 WA -
testcase_19 RE -
testcase_20 AC 48 ms
36,788 KB
testcase_21 RE -
testcase_22 RE -
testcase_23 RE -
testcase_24 RE -
testcase_25 RE -
testcase_26 WA -
testcase_27 AC 51 ms
36,288 KB
testcase_28 WA -
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.IOException;
import java.io.InputStream;
import java.util.NoSuchElementException;


public class Main {
  public static void main(String[] args) {
    FastScanner sc = new FastScanner();
    int N = sc.nextInt();
    int[] a = sc.nextIntList(N);


    long[][] dp = new long[N + 1][2];
    for (int i = 0; i < N; i ++) {
      long x1 = dp[i][0] * a[i]; 
      long x2 = dp[i][1] * a[i]; 
      long x3 = dp[i][0] + a[i]; 
      long x4 = dp[i][1] + a[i]; 
      long x5 = dp[i][0] - a[i]; 
      long x6 = dp[i][1] - a[i]; 
      long x7 = dp[i][0] / a[i]; 
      long x8 = dp[i][1] / a[i]; 
      
      dp[i + 1][0] = x1;
      dp[i + 1][1] = x1;

      dp[i + 1][0] = Math.max(dp[i + 1][0], x2);
      dp[i + 1][0] = Math.max(dp[i + 1][0], x3);
      dp[i + 1][0] = Math.max(dp[i + 1][0], x4);
      dp[i + 1][0] = Math.max(dp[i + 1][0], x5);
      dp[i + 1][0] = Math.max(dp[i + 1][0], x6);
      dp[i + 1][0] = Math.max(dp[i + 1][0], x7);
      dp[i + 1][0] = Math.max(dp[i + 1][0], x8);
      dp[i + 1][1] = Math.min(dp[i + 1][1], x2);
      dp[i + 1][1] = Math.min(dp[i + 1][1], x3);
      dp[i + 1][1] = Math.min(dp[i + 1][1], x4);
      dp[i + 1][1] = Math.min(dp[i + 1][1], x5);
      dp[i + 1][1] = Math.min(dp[i + 1][1], x6);
      dp[i + 1][1] = Math.min(dp[i + 1][1], x7);
      dp[i + 1][1] = Math.min(dp[i + 1][1], x8);
    }
    
    System.out.println(dp[N][0]);
  }

}


class FastScanner {
	public static String debug = null;

	private final InputStream in = System.in;
	private int ptr = 0;
	private int buflen = 0;
	private byte[] buffer = new byte[1024];
	private boolean eos = false;

	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		} else {
			ptr = 0;
			try {
				if (debug != null) {
					buflen = debug.length();
					buffer = debug.getBytes();
					debug = "";
					eos = true;
				} else {
					buflen = in.read(buffer);
				}
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen < 0) {
				eos = true;
				return false;
			} else if (buflen == 0) {
				return false;
			}
		}
		return true;
	}

	private int readByte() {
		if (hasNextByte())
			return buffer[ptr++];
		else
			return -1;
	}

	private static boolean isPrintableChar(int c) {
		return 33 <= c && c <= 126;
	}

	private void skipUnprintable() {
		while (hasNextByte() && !isPrintableChar(buffer[ptr]))
			ptr++;
	}

	public boolean isEOS() {
		return this.eos;
	}

	public boolean hasNext() {
		skipUnprintable();
		return hasNextByte();
	}

	public String next() {
		if (!hasNext())
			throw new NoSuchElementException();
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while (isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}

	public long nextLong() {
		if (!hasNext())
			throw new NoSuchElementException();
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {
			throw new NumberFormatException();
		}
		while (true) {
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			} else if (b == -1 || !isPrintableChar(b)) {
				return minus ? -n : n;
			} else {
				throw new NumberFormatException();
			}
			b = readByte();
		}
	}

	public int nextInt() {
		return (int) nextLong();
	}

	public long[] nextLongList(int n) {
		return nextLongTable(1, n)[0];
	}

	public int[] nextIntList(int n) {
		return nextIntTable(1, n)[0];
	}

	public long[][] nextLongTable(int n, int m) {
		long[][] ret = new long[n][m];
		for (int i = 0; i < n; i ++) {
			for (int j = 0; j < m; j ++) {
				ret[i][j] = nextLong();
			}
		}
		return ret;
	}

	public int[][] nextIntTable(int n, int m) {
		int[][] ret = new int[n][m];
		for (int i = 0; i < n; i ++) {
			for (int j = 0; j < m; j ++) {
				ret[i][j] = nextInt();
			}
		}
		return ret;
	}
}
0