結果
問題 | No.972 選び方のスコア |
ユーザー | k_6101 |
提出日時 | 2020-01-18 02:36:13 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,087 bytes |
コンパイル時間 | 2,269 ms |
コンパイル使用メモリ | 90,692 KB |
実行使用メモリ | 66,836 KB |
最終ジャッジ日時 | 2023-09-08 12:56:24 |
合計ジャッジ時間 | 25,822 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 887 ms
64,848 KB |
testcase_01 | AC | 881 ms
64,472 KB |
testcase_02 | AC | 833 ms
65,240 KB |
testcase_03 | AC | 641 ms
61,324 KB |
testcase_04 | AC | 829 ms
64,656 KB |
testcase_05 | AC | 843 ms
64,528 KB |
testcase_06 | AC | 844 ms
64,676 KB |
testcase_07 | AC | 754 ms
64,592 KB |
testcase_08 | AC | 764 ms
64,900 KB |
testcase_09 | AC | 736 ms
65,024 KB |
testcase_10 | AC | 770 ms
66,416 KB |
testcase_11 | AC | 786 ms
64,860 KB |
testcase_12 | AC | 790 ms
64,404 KB |
testcase_13 | AC | 794 ms
64,776 KB |
testcase_14 | AC | 795 ms
64,972 KB |
testcase_15 | AC | 786 ms
64,476 KB |
testcase_16 | AC | 797 ms
64,856 KB |
testcase_17 | AC | 797 ms
65,072 KB |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | AC | 126 ms
55,740 KB |
testcase_26 | AC | 128 ms
55,896 KB |
testcase_27 | AC | 130 ms
55,804 KB |
testcase_28 | RE | - |
testcase_29 | RE | - |
testcase_30 | AC | 128 ms
56,148 KB |
testcase_31 | AC | 130 ms
55,792 KB |
testcase_32 | AC | 130 ms
55,872 KB |
testcase_33 | AC | 145 ms
55,976 KB |
testcase_34 | AC | 138 ms
57,844 KB |
ソースコード
import java.io.BufferedWriter; import java.io.FileWriter; import java.io.InputStream; import java.io.PrintWriter; import java.lang.reflect.Array; import java.math.BigDecimal; import java.math.MathContext; import java.util.ArrayDeque; import java.util.ArrayList; import java.util.Arrays; import java.util.Collections; import java.util.Comparator; import java.util.Deque; import java.util.HashMap; import java.util.HashSet; import java.util.Iterator; import java.util.List; import java.util.Map; import java.util.Map.Entry; import java.util.PriorityQueue; import java.util.Queue; import java.util.Random; import java.util.Scanner; import java.util.Set; import java.util.Stack; import java.util.TreeMap; import java.util.TreeSet; import static java.util.Comparator.*; public class Main { public static void main(String[] args) { PrintWriter out = new PrintWriter(System.out); Solver solver = new Solver(System.in, out); solver.solve(); out.close(); } } class Solver { Scanner sc; PrintWriter out; public Solver(InputStream in, PrintWriter out) { sc = new Scanner(in); this.out = out; } // ========================================================== public void solve() { int N = ni(); int[] A = ndi(N); Arrays.sort(A); long ans = A[0] - A[1] + A[N-1] - A[1]; long wk = ans, sa; int index = 2; for (int i = 5; i < N; i+=2) { sa = (long)(A[index] - A[index-1]); wk = wk - sa * (index * 2 - 1) + (long)(A[N-index] - A[index]); ans = Math.max(ans, wk); index++; } out.println(ans); } // Set に入れるなら PPKEY を使う! static class PP{ public int key, val; public PP(int key, int val) { this.key = key; this.val = val; } public int getKey() { return key; } public void setKey(int key) { this.key = key; } public int getVal() { return val; } public void setVal(int val) { this.val = val; } } // ------------------------------------------ // 入力 // ------------------------------------------ public int ni() { return sc.nextInt(); } public long nl() { return sc.nextLong(); } public String ns() { return sc.next(); } public char[] nc() { return sc.next().toCharArray(); } public int[] ndi(int N) { int[] ans = new int[N]; for (int i = 0; i < N; i++) { ans[i] = ni(); } return ans; } public long[] ndl(int N) { long[] ans = new long[N]; for (int i = 0; i < N; i++) { ans[i] = nl(); } return ans; } public String[] nds(int N) { String[] ans = new String[N]; for (int i = 0; i < N; i++) { ans[i] = ns(); } return ans; } public char[][] ndc(int N) { char[][] ans = new char[N][]; for (int i = 0; i < N; i++) { ans[i] = nc(); } return ans; } public int[][] nddi(int N, int S) { int[][] ans = new int[N][S]; for (int i = 0; i < N; i++) { for (int j = 0; j < S; j++) { ans[i][j] = ni(); } } return ans; } }