結果
問題 |
No.45 回転寿司
|
ユーザー |
![]() |
提出日時 | 2020-05-02 18:34:24 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 64 ms / 5,000 ms |
コード長 | 3,325 bytes |
コンパイル時間 | 2,920 ms |
コンパイル使用メモリ | 78,816 KB |
実行使用メモリ | 52,356 KB |
最終ジャッジ日時 | 2024-12-30 22:57:39 |
合計ジャッジ時間 | 6,470 ms |
ジャッジサーバーID (参考情報) |
judge6 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 30 |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.NoSuchElementException; class Main implements Runnable { private final FastScanner sc; private final PrintWriter out; //private final long MOD = 1000000007; //private final int[] d8x = {-1,0,1,1,1,0,-1,-1}; //private final int[] d8y = {-1,-1,-1,0,1,1,1,0}; //private final int[] d4x = {0,1,0,-1}; //private final int[] d4y = {-1,0,1,0}; int n; int[] v; public static void main(String[] args) { new Thread(null, new Main(), "", 16L * 1024 * 1024).start(); } Main() { sc = new FastScanner(); out = new PrintWriter(System.out); } private void init() throws Exception { n = sc.nextInt(); v = new int[n]; for(int i = 0;i<n;i++){ v[i] = sc.nextInt(); } } private void solve() throws Exception{ int[] dp = new int[n+1]; dp[0] = 0; dp[1] = v[0]; for(int i=2;i<=n;i++){ dp[i] = Math.max(dp[i-1], dp[i-2] + v[i-1]); } out.println(dp[n]); } public void run() { try { init(); sc.close(); solve(); } catch (Exception e) { e.printStackTrace(); System.exit(1); } out.flush(); out.close(); } } class FastScanner { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; private boolean read() { if (ptr < buflen) { return true; } else { ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } return true; } } private boolean hasNext() { while (read() && !isVisibleChar(buffer[ptr])) ptr++; return read(); } private int getNextChar() { if (read()) { ptr++; return buffer[ptr - 1]; } else { return -1; } } private static boolean isVisibleChar(int code) { return code >= 33 && code <= 126; } public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = getNextChar(); while (isVisibleChar(b)) { sb.appendCodePoint(b); b = getNextChar(); } return sb.toString(); } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); long n = 0; boolean sign = true; int b = getNextChar(); if (b == '-') { sign = false; b = getNextChar(); } if (b < '0' || b > '9') { throw new NumberFormatException(); } while (true) { if (b >= '0' && b <= '9') { n *= 10; n += b - '0'; } else if (b == -1 || !isVisibleChar(b)) { return sign ? n : -n; } else { throw new NumberFormatException(); } b = getNextChar(); } } public int nextInt() { long n = nextLong(); if (n < Integer.MIN_VALUE || n > Integer.MAX_VALUE) throw new NumberFormatException(); return (int) n; } public double nextDouble() { return Double.parseDouble(next()); } public void close() { try { in.close(); } catch (IOException e) { e.printStackTrace(); } } } class IntQueue { protected int[] a; protected int head, tail; public IntQueue(int max) { a = new int[max]; } public void offer(int x) { a[tail++] = x; } public int poll() { return a[head++]; } public int peek() { return a[head]; } public int size() { return tail - head; } }