結果
問題 | No.865 24時間降水量 |
ユーザー |
![]() |
提出日時 | 2019-08-16 21:56:01 |
言語 | D (dmd 2.109.1) |
結果 |
AC
|
実行時間 | 185 ms / 2,000 ms |
コード長 | 1,857 bytes |
コンパイル時間 | 774 ms |
コンパイル使用メモリ | 115,332 KB |
実行使用メモリ | 10,464 KB |
最終ジャッジ日時 | 2024-06-22 02:11:49 |
合計ジャッジ時間 | 2,199 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 18 |
コンパイルメッセージ
/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/numeric.d(2999): Warning: cannot inline function `std.numeric.gcdImpl!ulong.gcdImpl`
ソースコード
import std.stdio, std.conv, std.functional, std.string;import std.algorithm, std.array, std.container, std.range, std.typecons;import std.numeric, std.math, std.random;import core.bitop;string FMT_F = "%.10f";static string[] s_rd;T RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }string RDR()() { return readln.chomp; }T[] ARR(T = long)(in string str, T fix = 0) { auto r = str.split.to!(T[]); r[] += fix; return r; }T[] RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; }T[][] RDA2(T = long)(size_t n, T[] fix = []) { auto r = new T[][](n); foreach (i; 0..n) { r[i] = readln.chomp.split.to!(T[]); foreach (j, e; fix)r[i][j] += e; } return r; }size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }bool inside(T)(T x, T b, T e) { return x >= b && x < e; }long lcm(long x, long y) { return x * y / gcd(x, y); }long mod = 10^^9 + 7;//long mod = 998244353;//long mod = 1_000_003;void moda(ref long x, long y) { x = (x + y) % mod; }void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; }void modm(ref long x, long y) { x = (x * y) % mod; }void main(){auto N = RD;auto A = RDA;auto Q = RD;auto B = new long[](N+1);foreach (i; 0..24){B[0] += A[i];}long ans = B[0];foreach (i; 0..N-24){B[i+1] = B[i] - A[i] + A[i+24];ans = max(ans, B[i+1]);}foreach (i; 0..Q){auto T = RD-1;auto V = RD;auto begin = max(0, T-23);foreach (j; begin..T+1){B[j] += V - A[T];ans = max(ans, B[j]);}A[T] = V;writeln(ans);}stdout.flush();debug readln();}