結果
問題 | No.919 You Are A Project Manager |
ユーザー |
👑 |
提出日時 | 2019-10-25 23:13:59 |
言語 | D (dmd 2.109.1) |
結果 |
AC
|
実行時間 | 83 ms / 3,000 ms |
コード長 | 3,895 bytes |
コンパイル時間 | 1,234 ms |
コンパイル使用メモリ | 128,128 KB |
実行使用メモリ | 11,088 KB |
最終ジャッジ日時 | 2024-06-22 02:58:35 |
合計ジャッジ時間 | 3,813 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 55 |
ソースコード
import std.conv, std.functional, std.range, std.stdio, std.string;import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;import core.bitop;class EOFException : Throwable { this() { super("EOF"); } }string[] tokens;string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }int readInt() { return readToken.to!int; }long readLong() { return readToken.to!long; }real readReal() { return readToken.to!real; }bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1;(unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }void main() {try {for (; ; ) {const N = readInt();auto A = new int[N];foreach (i; 0 .. N) {A[i] = readInt();}const xs = A.dup.sort.uniq.array;const asLen = cast(int)(xs.length);int V;int[] l, r;int[] sum;int node() {l ~= 0;r ~= 0;sum ~= 0;return V++;}int segN;for (segN = 1; segN < asLen; segN <<= 1) {}auto seg = iota(segN << 1).array;V = segN << 1;l = new int[V];r = new int[V];sum = new int[V];foreach_reverse (a; 1 .. segN) {l[a] = a << 1;r[a] = a << 1 | 1;}// persistentauto roots = new int[N + 1];roots[0] = 0;foreach (i; 0 .. N) {// insert A[i]int a = xs.lowerBound(A[i]);a += segN;const old = seg[a];seg[a] = node();sum[seg[a]] = sum[old] + 1;for (; a >>= 1; ) {seg[a] = node();l[seg[a]] = seg[a << 1];r[seg[a]] = seg[a << 1 | 1];sum[seg[a]] = sum[l[seg[a]]] + sum[r[seg[a]]];}roots[i + 1] = seg[1];}debug {writeln("l = ", l);writeln("r = ", r);writeln("sum = ", sum);writeln("roots = ", roots);}int getMedian(int i, int j) {// min x s.t. # (< x) >= (j - i + 1) / 2int u = roots[i], v = roots[j];int pos;int s;for (int w = segN; w >>= 1; ) {if (s + (sum[l[v]] - sum[l[u]]) >= (j - i + 1) / 2) {u = l[u];v = l[v];} else {pos += w;s += (sum[l[v]] - sum[l[u]]);u = r[u];v = r[v];}}debug {writefln("median [%s, %s) = xs[%s]", i, j, pos);}return xs[pos];}long ans;foreach (k; 1 .. N + 1) {auto ls = new long[N / k + 1];foreach (e; 0 .. N / k) {ls[e + 1] = ls[e] + getMedian(k * e, k * (e + 1));}auto rs = new long[N / k + 1];foreach (e; 0 .. N / k) {rs[e + 1] = rs[e] + getMedian(N - k * (e + 1), N - k * e);}debug {writeln("k = ", k);writeln(" ls = ", ls);writeln(" rs = ", rs);}foreach (e; 0 .. N / k) {chmax(ls[e + 1], ls[e]);}long mx;foreach (e; 0 .. N / k + 1) {chmax(mx, ls[N / k - e] + rs[e]);}debug {writeln(" mx = ", mx);}chmax(ans, k * mx);}writeln(ans);}} catch (EOFException e) {}}