結果

問題 No.972 選び方のスコア
ユーザー uwiuwi
提出日時 2020-01-17 21:36:21
言語 Java21
(openjdk 21)
結果
AC  
実行時間 298 ms / 2,000 ms
コード長 4,645 bytes
コンパイル時間 4,499 ms
コンパイル使用メモリ 85,632 KB
実行使用メモリ 43,724 KB
最終ジャッジ日時 2024-06-25 18:56:08
合計ジャッジ時間 12,341 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 230 ms
43,204 KB
testcase_01 AC 290 ms
42,900 KB
testcase_02 AC 206 ms
42,288 KB
testcase_03 AC 195 ms
41,936 KB
testcase_04 AC 290 ms
43,268 KB
testcase_05 AC 215 ms
42,288 KB
testcase_06 AC 290 ms
43,360 KB
testcase_07 AC 187 ms
41,828 KB
testcase_08 AC 142 ms
41,380 KB
testcase_09 AC 141 ms
41,168 KB
testcase_10 AC 143 ms
41,156 KB
testcase_11 AC 151 ms
41,768 KB
testcase_12 AC 154 ms
42,356 KB
testcase_13 AC 158 ms
41,712 KB
testcase_14 AC 157 ms
42,476 KB
testcase_15 AC 157 ms
42,944 KB
testcase_16 AC 158 ms
42,368 KB
testcase_17 AC 156 ms
43,008 KB
testcase_18 AC 53 ms
37,248 KB
testcase_19 AC 217 ms
43,140 KB
testcase_20 AC 224 ms
42,980 KB
testcase_21 AC 220 ms
43,384 KB
testcase_22 AC 298 ms
43,008 KB
testcase_23 AC 295 ms
43,476 KB
testcase_24 AC 218 ms
43,724 KB
testcase_25 AC 53 ms
37,092 KB
testcase_26 AC 52 ms
37,240 KB
testcase_27 AC 51 ms
37,108 KB
testcase_28 AC 53 ms
37,244 KB
testcase_29 AC 53 ms
37,500 KB
testcase_30 AC 52 ms
37,356 KB
testcase_31 AC 52 ms
36,944 KB
testcase_32 AC 52 ms
37,384 KB
testcase_33 AC 52 ms
36,820 KB
testcase_34 AC 53 ms
37,348 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest200117;
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 D {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		int[] a = na(n);
		Arrays.sort(a);
		
		long[] cum = new long[n+1];
		for(int i = 0;i < n;i++)cum[i+1] = cum[i] + a[i];
		int tail = 0;
		long ans = 0;
		for(int i = 0;i < n;i++) {
			while(tail > i || tail > n-i-1) {
				tail--;
			}
			
			long cur = (cum[i+1] - cum[i+1-tail-1]) + (cum[n] - cum[n-tail]) - (long)a[i] * (2*tail+1);
			while(true) {
				ans = Math.max(ans, cur);
				if(i-(tail+1) >= 0 && n-(tail+1) > i) {
					tail++;
					long nex = (cum[i+1] - cum[i+1-tail-1]) + (cum[n] - cum[n-tail]) - (long)a[i] * (2*tail+1);
					if(nex >= cur) {
						cur = nex;
					}else {
						tail--;
						break;
					}
				}else {
					break;
				}
			}
		}
		
		tail = 0;
		for(int i = 0;i < n-1;i++) {
			while(tail > i || tail > n-i-2) {
				tail--;
			}
			
			long cur = (cum[i+2] - cum[i+1-tail-1]) + (cum[n] - cum[n-tail]) - (long)(a[i] + a[i+1]) * (tail+1);
			while(true) {
				ans = Math.max(ans, cur);
				if(i-(tail+1) >= 0 && n-(tail+1) > i+1) {
					tail++;
					long nex = (cum[i+1] - cum[i+1-tail-1]) + (cum[n] - cum[n-tail]) - (long)(a[i] + a[i+1]) * (tail+1);
					if(nex >= cur) {
						cur = nex;
					}else {
						tail--;
						break;
					}
				}else {
					break;
				}
			}
		}
		
		out.println(ans);
	}
	
	public static int lowerBound(int[] a, int v){ return lowerBound(a, 0, a.length, v); }
	public static int lowerBound(int[] a, int l, int r, int v)
	{
		if(l > r || l < 0 || r > a.length)throw new IllegalArgumentException();
		int low = l-1, high = r;
		while(high-low > 1){
			int h = high+low>>>1;
			if(a[h] >= v){
				high = h;
			}else{
				low = h;
			}
		}
		return high;
	}

	
	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 D().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)); }
}
0