結果

問題 No.3129 Multiple of Twin Subarray
ユーザー tenten
提出日時 2025-04-30 15:55:15
言語 Java
(openjdk 23)
結果
AC  
実行時間 171 ms / 2,000 ms
コード長 4,505 bytes
コンパイル時間 3,310 ms
コンパイル使用メモリ 80,876 KB
実行使用メモリ 56,248 KB
最終ジャッジ日時 2025-04-30 15:55:28
合計ジャッジ時間 11,332 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 46
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;
import java.util.function.*;
import java.util.stream.*;

public class Main {
    public static void main(String[] args) throws Exception {
        FastScanner sc = new FastScanner();
        int n = sc.nextInt();
        int[] values = new int[n];
        for (int i = 0; i < n; i++) {
            values[i] = sc.nextInt();
        }
        int[][] lefts = getLeft(values);
        int[][] rights = getRight(values);
        long ans = Long.MIN_VALUE;
        for (int i = 1; i < n; i++) {
            ans = Math.max(ans, (long)lefts[i][0] * rights[i + 1][0]);
            ans = Math.max(ans, (long)lefts[i][1] * rights[i + 1][1]);
        }
        System.out.println(ans);
    }
    
    static int[][] getLeft(int[] values) {
        int length = values.length;;
        int min = 0;
        int max = 0;
        int current = 0;
        int[][] ans = new int[length + 2][2];
        ans[0][0] = Integer.MIN_VALUE;
        ans[0][1] = Integer.MAX_VALUE;
        for (int i = 1; i <= length; i++) {
            current += values[i - 1];
            ans[i][0] = Math.max(ans[i - 1][0], current - min);
            ans[i][1] = Math.min(ans[i - 1][1], current - max);
            min = Math.min(min, current);
            max = Math.max(max, current);
        }
        return ans;
    }
    
    static int[][] getRight(int[] values) {
        int length = values.length;;
        int min = 0;
        int max = 0;
        int current = 0;
        int[][] ans = new int[length + 2][2];
        ans[length + 1][0] = Integer.MIN_VALUE;
        ans[length + 1][1] = Integer.MAX_VALUE;
        for (int i = length; i >= 1; i--) {
            current += values[i - 1];
            ans[i][0] = Math.max(ans[i + 1][0], current - min);
            ans[i][1] = Math.min(ans[i + 1][1], current - max);
            min = Math.min(min, current);
            max = Math.max(max, current);
        }
        return ans;
    }
}

class FastScanner {
    private DataInputStream din;
    private byte[] buffer;
    private int bufferPointer, bytesRead;
    private static final int BUFFER_SIZE = 1 << 16; // 65,536 バイト

    public FastScanner() {
        din = new DataInputStream(System.in);
        buffer = new byte[BUFFER_SIZE];
        bufferPointer = bytesRead = 0;
    }

    private byte read() {
        try {
            if (bufferPointer == bytesRead) {
                bytesRead = din.read(buffer, 0, BUFFER_SIZE);
                if (bytesRead == -1) return -1;
                bufferPointer = 0;
            }
            return buffer[bufferPointer++];
        } catch (IOException e) {
            throw new RuntimeException(e);
        }
    }

    public String next() {
        byte b = read();
        // 空白文字を読み飛ばす
        while (isSpaceChar(b)) {
            b = read();
        }
        StringBuilder sb = new StringBuilder();
        while (!isSpaceChar(b)) {
            sb.append((char) b);
            b = read();
        }
        return sb.toString();
    }

    public int nextInt() {
        int ret = 0;
        byte c = read();
        while (isSpaceChar(c)) c = read();
        boolean neg = (c == '-');
        if (neg) c = read();
        do {
            ret = ret * 10 + c - '0';
            c = read();
        } while (!isSpaceChar(c));
        return neg ? -ret : ret;
    }

    public long nextLong() {
        long ret = 0;
        byte c = read();
        while (isSpaceChar(c)) c = read();
        boolean neg = (c == '-');
        if (neg) c = read();
        do {
            ret = ret * 10L + c - '0';
            c = read();
        } while (!isSpaceChar(c));
        return neg ? -ret : ret;
    }

    public double nextDouble() {
        double ret = 0, div = 1;
        byte c = read();
        while (isSpaceChar(c)) c = read();
        boolean neg = (c == '-');
        if (neg) c = read();
        do {
            ret = ret * 10 + c - '0';
            c = read();
        } while (!isSpaceChar(c) && c != '.');
        if (c == '.') {
            while (!isSpaceChar(c = read())) {
                ret += (c - '0') / (div *= 10);
            }
        }
        return neg ? -ret : ret;
    }

    private boolean isSpaceChar(byte c) {
        return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
    }

    public void close() {
        try {
            if (din != null) din.close();
        } catch (IOException e) {
            throw new RuntimeException(e);
        }
    }
}
0