結果
問題 |
No.664 超能力者Aと株価予測
|
ユーザー |
![]() |
提出日時 | 2018-03-25 01:24:29 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 128 ms / 4,000 ms |
コード長 | 3,035 bytes |
コンパイル時間 | 3,475 ms |
コンパイル使用メモリ | 90,084 KB |
実行使用メモリ | 39,936 KB |
最終ジャッジ日時 | 2024-06-25 04:33:29 |
合計ジャッジ時間 | 4,586 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 15 |
ソースコード
public class Main { private static void solve() { int n = ni(); int m = ni(); int k = ni(); int[] a = na(n + 1); long[][] dp = new long[m + 1][n + 1]; dp[0][0] = k; for (int t = 0; t <= m; t ++) { for (int i = 1; i <= n; i ++) { dp[t][i] = dp[t][i - 1]; if (t == 0) continue; for (int j = i - 1; j >= 0; j --) { long s = dp[t - 1][j] / a[j]; long last = dp[t - 1][j] - s * a[j]; dp[t][i] = Math.max(dp[t][i], last + s * a[i]); } } } long ret = 0; for (int i = 0; i <= m; i ++) { ret = Math.max(ret, dp[i][n]); } System.out.println(ret); } public static void main(String[] args) { new Thread(null, new Runnable() { @Override public void run() { long start = System.currentTimeMillis(); String debug = args.length > 0 ? args[0] : null; if (debug != null) { try { is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug)); } catch (Exception e) { throw new RuntimeException(e); } } reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768); solve(); out.flush(); tr((System.currentTimeMillis() - start) + "ms"); } }, "", 64000000).start(); } private static java.io.InputStream is = System.in; private static java.io.PrintWriter out = new java.io.PrintWriter(System.out); private static java.util.StringTokenizer tokenizer = null; private static java.io.BufferedReader reader; public static String next() { while (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new java.util.StringTokenizer(reader.readLine()); } catch (Exception e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } private static double nd() { return Double.parseDouble(next()); } private static long nl() { return Long.parseLong(next()); } private static int[] na(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = ni(); return a; } private static char[] ns() { return next().toCharArray(); } private static long[] nal(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nl(); return a; } private static int[][] ntable(int n, int m) { int[][] table = new int[n][m]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[i][j] = ni(); } } return table; } private static int[][] nlist(int n, int m) { int[][] table = new int[m][n]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[j][i] = ni(); } } return table; } private static int ni() { return Integer.parseInt(next()); } private static void tr(Object... o) { if (is != System.in) System.out.println(java.util.Arrays.deepToString(o)); } }