結果

問題 No.505 カードの数式2
ユーザー GrenacheGrenache
提出日時 2017-04-21 22:46:07
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,819 bytes
コンパイル時間 4,139 ms
コンパイル使用メモリ 78,384 KB
実行使用メモリ 50,484 KB
最終ジャッジ日時 2024-07-20 05:36:00
合計ジャッジ時間 6,593 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 55 ms
50,004 KB
testcase_01 AC 55 ms
50,276 KB
testcase_02 AC 56 ms
50,208 KB
testcase_03 AC 55 ms
50,308 KB
testcase_04 AC 55 ms
49,892 KB
testcase_05 AC 55 ms
50,008 KB
testcase_06 AC 55 ms
50,196 KB
testcase_07 AC 52 ms
36,792 KB
testcase_08 AC 51 ms
37,048 KB
testcase_09 AC 57 ms
37,000 KB
testcase_10 AC 52 ms
36,880 KB
testcase_11 AC 52 ms
37,068 KB
testcase_12 AC 51 ms
37,120 KB
testcase_13 WA -
testcase_14 AC 57 ms
37,036 KB
testcase_15 WA -
testcase_16 AC 52 ms
36,784 KB
testcase_17 AC 53 ms
36,784 KB
testcase_18 AC 52 ms
36,716 KB
testcase_19 WA -
testcase_20 AC 53 ms
36,952 KB
testcase_21 AC 51 ms
37,052 KB
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 AC 53 ms
37,044 KB
testcase_30 AC 51 ms
36,988 KB
testcase_31 AC 52 ms
36,868 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;


public class Main_yukicoder505 {

	private static Scanner sc;
	private static Printer pr;

	private static void solve() {
		int n = sc.nextInt();

		int[] a = new int[n];
		for (int i = 0; i < n; i++) {
			a[i] = sc.nextInt();
		}

		long[] dpmax = new long[n];
		long[] dpmin = new long[n];
		Arrays.fill(dpmax, Long.MIN_VALUE);
		Arrays.fill(dpmin, Long.MAX_VALUE);
		dpmax[0] = a[0];
		dpmin[0] = a[0];
		for (int i = 1; i < n; i++) {
			for (int j = 0; j < 4; j++) {
				if (j == 0) {
					dpmax[i] = Math.max(dpmax[i], dpmax[i - 1] + a[i]);
					dpmin[i] = Math.min(dpmin[i], dpmin[i - 1] + a[i]);
				} else if (j == 1) {
					dpmax[i] = Math.max(dpmax[i], dpmax[i - 1] - a[i]);
					dpmin[i] = Math.min(dpmin[i], dpmin[i - 1] - a[i]);
				} else if (j == 2) {
					dpmax[i] = Math.max(dpmax[i], dpmax[i - 1] * a[i]);
					dpmin[i] = Math.min(dpmin[i], dpmin[i - 1] * a[i]);
				} else if (j == 3 && a[i] != 0) {
					dpmax[i] = Math.max(dpmax[i], dpmax[i - 1] / a[i]);
					dpmin[i] = Math.min(dpmin[i], dpmin[i - 1] / a[i]);
				}
			}
		}

		pr.println(dpmax[n - 1]);
	}

	// ---------------------------------------------------
	public static void main(String[] args) {
		sc = new Scanner(System.in);
		pr = new Printer(System.out);

		solve();

		pr.close();
		sc.close();
	}

	@SuppressWarnings("unused")
	private static class Scanner {
		BufferedReader br;

		Scanner (InputStream in) {
			br = new BufferedReader(new InputStreamReader(in));
		}

		private boolean isPrintable(int ch) {
			return ch >= '!' && ch <= '~';
		}

		private boolean isCRLF(int ch) {
			return ch == '\n' || ch == '\r' || ch == -1;
		}

		private int nextPrintable() {
			try {
				int ch;
				while (!isPrintable(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}

				return ch;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		String next() {
			try {
				int ch = nextPrintable();
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (isPrintable(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		int nextInt() {
			try {
				// parseInt from Integer.parseInt()
				boolean negative = false;
				int res = 0;
				int limit = -Integer.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Integer.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				int multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		long nextLong() {
			try {
				// parseLong from Long.parseLong()
				boolean negative = false;
				long res = 0;
				long limit = -Long.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Long.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				long multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		float nextFloat() {
			return Float.parseFloat(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		String nextLine() {
			try {
				int ch;
				while (isCRLF(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (!isCRLF(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		void close() {
			try {
				br.close();
			} catch (IOException e) {
//				throw new NoSuchElementException();
			}
		}
	}

	private static class Printer extends PrintWriter {
		Printer(PrintStream out) {
			super(out);
		}
	}
}
0