結果
問題 | No.258 回転寿司(2) |
ユーザー | holeguma |
提出日時 | 2015-10-13 17:39:20 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 75 ms / 2,000 ms |
コード長 | 3,467 bytes |
コンパイル時間 | 2,336 ms |
コンパイル使用メモリ | 83,668 KB |
実行使用メモリ | 38,200 KB |
最終ジャッジ日時 | 2024-04-24 11:12:47 |
合計ジャッジ時間 | 9,637 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 63 ms
37,708 KB |
testcase_01 | AC | 65 ms
37,708 KB |
testcase_02 | AC | 64 ms
38,052 KB |
testcase_03 | AC | 60 ms
37,732 KB |
testcase_04 | AC | 60 ms
37,840 KB |
testcase_05 | AC | 64 ms
37,484 KB |
testcase_06 | AC | 64 ms
37,512 KB |
testcase_07 | AC | 62 ms
37,592 KB |
testcase_08 | AC | 62 ms
38,048 KB |
testcase_09 | AC | 62 ms
37,916 KB |
testcase_10 | AC | 65 ms
37,424 KB |
testcase_11 | AC | 64 ms
37,656 KB |
testcase_12 | AC | 64 ms
37,736 KB |
testcase_13 | AC | 60 ms
37,572 KB |
testcase_14 | AC | 64 ms
37,920 KB |
testcase_15 | AC | 59 ms
37,488 KB |
testcase_16 | AC | 60 ms
37,920 KB |
testcase_17 | AC | 57 ms
37,540 KB |
testcase_18 | AC | 63 ms
37,868 KB |
testcase_19 | AC | 60 ms
37,832 KB |
testcase_20 | AC | 71 ms
37,552 KB |
testcase_21 | AC | 65 ms
37,928 KB |
testcase_22 | AC | 60 ms
37,152 KB |
testcase_23 | AC | 58 ms
37,612 KB |
testcase_24 | AC | 58 ms
37,172 KB |
testcase_25 | AC | 56 ms
37,736 KB |
testcase_26 | AC | 60 ms
37,840 KB |
testcase_27 | AC | 60 ms
37,492 KB |
testcase_28 | AC | 73 ms
37,636 KB |
testcase_29 | AC | 60 ms
37,412 KB |
testcase_30 | AC | 59 ms
37,888 KB |
testcase_31 | AC | 59 ms
37,764 KB |
testcase_32 | AC | 62 ms
37,752 KB |
testcase_33 | AC | 71 ms
38,200 KB |
testcase_34 | AC | 73 ms
37,840 KB |
testcase_35 | AC | 73 ms
37,976 KB |
testcase_36 | AC | 59 ms
37,700 KB |
testcase_37 | AC | 61 ms
37,752 KB |
testcase_38 | AC | 60 ms
37,612 KB |
testcase_39 | AC | 59 ms
37,400 KB |
testcase_40 | AC | 58 ms
37,452 KB |
testcase_41 | AC | 71 ms
37,792 KB |
testcase_42 | AC | 70 ms
37,136 KB |
testcase_43 | AC | 65 ms
37,872 KB |
testcase_44 | AC | 66 ms
37,540 KB |
testcase_45 | AC | 64 ms
38,072 KB |
testcase_46 | AC | 59 ms
37,524 KB |
testcase_47 | AC | 62 ms
37,940 KB |
testcase_48 | AC | 61 ms
37,944 KB |
testcase_49 | AC | 58 ms
37,448 KB |
testcase_50 | AC | 59 ms
37,752 KB |
testcase_51 | AC | 60 ms
37,604 KB |
testcase_52 | AC | 59 ms
37,688 KB |
testcase_53 | AC | 61 ms
37,528 KB |
testcase_54 | AC | 64 ms
37,688 KB |
testcase_55 | AC | 67 ms
37,412 KB |
testcase_56 | AC | 63 ms
37,652 KB |
testcase_57 | AC | 60 ms
37,872 KB |
testcase_58 | AC | 60 ms
37,800 KB |
testcase_59 | AC | 62 ms
37,876 KB |
testcase_60 | AC | 70 ms
37,388 KB |
testcase_61 | AC | 63 ms
37,832 KB |
testcase_62 | AC | 69 ms
37,880 KB |
testcase_63 | AC | 75 ms
37,740 KB |
testcase_64 | AC | 67 ms
37,552 KB |
testcase_65 | AC | 73 ms
37,868 KB |
testcase_66 | AC | 59 ms
37,412 KB |
testcase_67 | AC | 62 ms
37,920 KB |
testcase_68 | AC | 60 ms
37,676 KB |
testcase_69 | AC | 69 ms
38,088 KB |
testcase_70 | AC | 67 ms
37,976 KB |
ソースコード
import java.io.InputStream; import java.io.IOException; import java.io.PrintWriter; import java.util.ArrayDeque; import java.util.ArrayList; import java.util.Arrays; import java.util.BitSet; import java.util.Comparator; import java.util.Collections; import java.util.Deque; import java.util.HashMap; import java.util.HashSet; import java.util.InputMismatchException; import java.util.Map; import java.util.NoSuchElementException; import java.util.PriorityQueue; import java.util.TreeMap; import java.util.TreeSet; import java.math.BigDecimal; import java.math.BigInteger; public class Main{ static PrintWriter out; static InputReader ir; static final int INF=Integer.MAX_VALUE; static final long LINF=Long.MAX_VALUE; static void solve(){ int n=ir.nextInt(); int[] v=ir.nextIntArray(n); int[] dp=new int[n+2]; for(int i=n-1;i>=0;i--){ dp[i]=Math.max(dp[i+2]+v[i],dp[i+1]); } StringBuilder sb=new StringBuilder(); for(int i=0;i<n;){ if(dp[i]==dp[i+2]+v[i]){ sb.append(i+1+" "); i+=2; } else i++; } out.println(dp[0]); sb.deleteCharAt(sb.length()-1); out.println(sb); } public static void main(String[] args) throws Exception{ ir=new InputReader(System.in); out=new PrintWriter(System.out); solve(); out.flush(); } static class InputReader { private InputStream in; private byte[] buffer=new byte[1024]; private int curbuf; private int lenbuf; public InputReader(InputStream in) {this.in=in; this.curbuf=this.lenbuf=0;} public boolean hasNextByte() { if(curbuf>=lenbuf){ curbuf= 0; try{ lenbuf=in.read(buffer); }catch(IOException e) { throw new InputMismatchException(); } if(lenbuf<=0) return false; } return true; } private int readByte(){if(hasNextByte()) return buffer[curbuf++]; else return -1;} private boolean isSpaceChar(int c){return !(c>=33&&c<=126);} private void skip(){while(hasNextByte()&&isSpaceChar(buffer[curbuf])) curbuf++;} public boolean hasNext(){skip(); return hasNextByte();} public String next(){ if(!hasNext()) throw new NoSuchElementException(); StringBuilder sb=new StringBuilder(); int b=readByte(); while(!isSpaceChar(b)){ sb.appendCodePoint(b); b=readByte(); } return sb.toString(); } public int nextInt() { if(!hasNext()) throw new NoSuchElementException(); int c=readByte(); while (isSpaceChar(c)) c=readByte(); boolean minus=false; if (c=='-') { minus=true; c=readByte(); } int res=0; do{ if(c<'0'||c>'9') throw new InputMismatchException(); res=res*10+c-'0'; c=readByte(); }while(!isSpaceChar(c)); return (minus)?-res:res; } public long nextLong() { if(!hasNext()) throw new NoSuchElementException(); int c=readByte(); while (isSpaceChar(c)) c=readByte(); boolean minus=false; if (c=='-') { minus=true; c=readByte(); } long res = 0; do{ if(c<'0'||c>'9') throw new InputMismatchException(); res=res*10+c-'0'; c=readByte(); }while(!isSpaceChar(c)); return (minus)?-res:res; } public double nextDouble(){return Double.parseDouble(next());} public BigInteger nextBigInteger(){return new BigInteger(next());} public BigDecimal nextBigDecimal(){return new BigDecimal(next());} public int[] nextIntArray(int n){ int[] a=new int[n]; for(int i=0;i<n;i++) a[i]=nextInt(); return a; } public char[][] nextCharMap(int n,int m){ char[][] map=new char[n][m]; for(int i=0;i<n;i++) map[i]=next().toCharArray(); return map; } } }