結果
問題 | No.258 回転寿司(2) |
ユーザー | uwi |
提出日時 | 2015-08-01 16:49:27 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 76 ms / 2,000 ms |
コード長 | 3,361 bytes |
コンパイル時間 | 3,355 ms |
コンパイル使用メモリ | 80,960 KB |
実行使用メモリ | 38,156 KB |
最終ジャッジ日時 | 2024-04-24 11:08:20 |
合計ジャッジ時間 | 10,515 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 68 ms
37,872 KB |
testcase_01 | AC | 67 ms
38,064 KB |
testcase_02 | AC | 76 ms
37,728 KB |
testcase_03 | AC | 58 ms
37,216 KB |
testcase_04 | AC | 60 ms
37,804 KB |
testcase_05 | AC | 60 ms
37,768 KB |
testcase_06 | AC | 74 ms
37,888 KB |
testcase_07 | AC | 59 ms
37,740 KB |
testcase_08 | AC | 59 ms
37,912 KB |
testcase_09 | AC | 62 ms
37,848 KB |
testcase_10 | AC | 59 ms
37,476 KB |
testcase_11 | AC | 58 ms
37,680 KB |
testcase_12 | AC | 61 ms
37,724 KB |
testcase_13 | AC | 60 ms
37,204 KB |
testcase_14 | AC | 65 ms
37,860 KB |
testcase_15 | AC | 73 ms
37,960 KB |
testcase_16 | AC | 59 ms
37,364 KB |
testcase_17 | AC | 62 ms
37,812 KB |
testcase_18 | AC | 75 ms
37,896 KB |
testcase_19 | AC | 61 ms
38,092 KB |
testcase_20 | AC | 69 ms
37,704 KB |
testcase_21 | AC | 64 ms
37,936 KB |
testcase_22 | AC | 58 ms
37,564 KB |
testcase_23 | AC | 57 ms
37,476 KB |
testcase_24 | AC | 56 ms
37,516 KB |
testcase_25 | AC | 60 ms
37,864 KB |
testcase_26 | AC | 66 ms
37,816 KB |
testcase_27 | AC | 66 ms
37,832 KB |
testcase_28 | AC | 65 ms
37,844 KB |
testcase_29 | AC | 61 ms
37,868 KB |
testcase_30 | AC | 60 ms
37,912 KB |
testcase_31 | AC | 62 ms
37,844 KB |
testcase_32 | AC | 62 ms
37,896 KB |
testcase_33 | AC | 62 ms
38,016 KB |
testcase_34 | AC | 61 ms
37,692 KB |
testcase_35 | AC | 61 ms
37,816 KB |
testcase_36 | AC | 58 ms
37,820 KB |
testcase_37 | AC | 58 ms
37,712 KB |
testcase_38 | AC | 61 ms
37,756 KB |
testcase_39 | AC | 58 ms
37,980 KB |
testcase_40 | AC | 65 ms
37,724 KB |
testcase_41 | AC | 62 ms
37,596 KB |
testcase_42 | AC | 61 ms
37,716 KB |
testcase_43 | AC | 59 ms
37,480 KB |
testcase_44 | AC | 63 ms
38,024 KB |
testcase_45 | AC | 60 ms
38,128 KB |
testcase_46 | AC | 61 ms
37,620 KB |
testcase_47 | AC | 61 ms
37,680 KB |
testcase_48 | AC | 60 ms
37,900 KB |
testcase_49 | AC | 59 ms
37,804 KB |
testcase_50 | AC | 59 ms
37,772 KB |
testcase_51 | AC | 63 ms
37,732 KB |
testcase_52 | AC | 62 ms
37,680 KB |
testcase_53 | AC | 56 ms
37,208 KB |
testcase_54 | AC | 59 ms
37,972 KB |
testcase_55 | AC | 61 ms
37,924 KB |
testcase_56 | AC | 60 ms
37,860 KB |
testcase_57 | AC | 59 ms
37,684 KB |
testcase_58 | AC | 59 ms
37,628 KB |
testcase_59 | AC | 68 ms
37,732 KB |
testcase_60 | AC | 65 ms
37,844 KB |
testcase_61 | AC | 67 ms
37,896 KB |
testcase_62 | AC | 65 ms
38,072 KB |
testcase_63 | AC | 64 ms
37,740 KB |
testcase_64 | AC | 66 ms
38,116 KB |
testcase_65 | AC | 62 ms
37,964 KB |
testcase_66 | AC | 62 ms
37,596 KB |
testcase_67 | AC | 69 ms
38,156 KB |
testcase_68 | AC | 62 ms
37,856 KB |
testcase_69 | AC | 61 ms
37,936 KB |
testcase_70 | AC | 59 ms
37,980 KB |
ソースコード
package q7xx; 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 Q710 { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(); int[] a = na(n); for(int i = 0, j = n-1;i < j;i++,j--){ int d = a[i]; a[i] = a[j]; a[j] = d; } int[] dp = new int[n+1]; int[] prev = new int[n+1]; Arrays.fill(prev, -1); int max = -1; int argmax = -1; for(int i = 0;i < n;i++){ dp[i] = a[i]; for(int j = Math.max(0, i-3);j < i-1;j++){ if(dp[j] + a[i] > dp[i]){ dp[i] = dp[j] + a[i]; prev[i] = j; } } if(dp[i] > max){ max = dp[i]; argmax = i; } } out.println(max); for(int j = argmax;j != -1;j = prev[j]){ out.print(n-j + " "); } out.println(); } 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 Q710().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)); } }