結果
問題 | No.865 24時間降水量 |
ユーザー | uwi |
提出日時 | 2019-08-16 21:28:02 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 608 ms / 2,000 ms |
コード長 | 3,499 bytes |
コンパイル時間 | 5,009 ms |
コンパイル使用メモリ | 89,544 KB |
実行使用メモリ | 66,304 KB |
最終ジャッジ日時 | 2023-10-23 21:34:24 |
合計ジャッジ時間 | 8,335 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 50 ms
52,396 KB |
testcase_01 | AC | 52 ms
53,432 KB |
testcase_02 | AC | 51 ms
53,432 KB |
testcase_03 | AC | 49 ms
53,432 KB |
testcase_04 | AC | 49 ms
52,428 KB |
testcase_05 | AC | 103 ms
55,712 KB |
testcase_06 | AC | 100 ms
55,768 KB |
testcase_07 | AC | 98 ms
55,712 KB |
testcase_08 | AC | 103 ms
55,468 KB |
testcase_09 | AC | 102 ms
55,560 KB |
testcase_10 | AC | 152 ms
56,956 KB |
testcase_11 | AC | 151 ms
57,004 KB |
testcase_12 | AC | 153 ms
56,996 KB |
testcase_13 | AC | 154 ms
54,964 KB |
testcase_14 | AC | 152 ms
57,080 KB |
testcase_15 | AC | 558 ms
66,104 KB |
testcase_16 | AC | 608 ms
66,304 KB |
testcase_17 | AC | 508 ms
66,104 KB |
testcase_18 | AC | 51 ms
53,428 KB |
testcase_19 | AC | 49 ms
53,432 KB |
testcase_20 | AC | 49 ms
53,432 KB |
ソースコード
package contest190816; 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 C { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(); int[] a = na(n); long[] cum = new long[n+1]; for(int i = 0;i < n;i++)cum[i+1] = cum[i] + a[i]; long max = 0; for(int i = 0;i <= n-24;i++){ max = Math.max(max, cum[i+24] - cum[i]); } for(int Q = ni();Q > 0;Q--){ int t = ni()-1, v = ni(); a[t] = v; for(int i = Math.max(0, t-23);i <= t;i++){ if(i+24 > n)break; long s = 0; for(int j = 0;j < 24;j++){ s += a[i+j]; } max = Math.max(max, s); } out.println(max); } } 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"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } public static void main(String[] args) throws Exception { new C().run(); } private byte[] inbuf = new byte[1024]; public 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 int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } 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[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } 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)); } }