結果

問題 No.672 最長AB列
ユーザー threepipes_sthreepipes_s
提出日時 2018-04-13 22:37:52
言語 Java19
(openjdk 21)
結果
AC  
実行時間 134 ms / 2,000 ms
コード長 2,680 bytes
コンパイル時間 2,229 ms
コンパイル使用メモリ 75,860 KB
実行使用メモリ 55,476 KB
最終ジャッジ日時 2023-09-10 00:05:32
合計ジャッジ時間 4,970 ms
ジャッジサーバーID
(参考情報)
judge15 / judge12
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 51 ms
52,752 KB
testcase_01 AC 51 ms
52,552 KB
testcase_02 AC 51 ms
54,516 KB
testcase_03 AC 51 ms
53,036 KB
testcase_04 AC 51 ms
52,564 KB
testcase_05 AC 51 ms
52,648 KB
testcase_06 AC 52 ms
52,996 KB
testcase_07 AC 51 ms
52,556 KB
testcase_08 AC 51 ms
52,972 KB
testcase_09 AC 129 ms
54,872 KB
testcase_10 AC 130 ms
55,084 KB
testcase_11 AC 130 ms
54,952 KB
testcase_12 AC 122 ms
55,116 KB
testcase_13 AC 122 ms
54,864 KB
testcase_14 AC 134 ms
55,060 KB
testcase_15 AC 133 ms
54,800 KB
testcase_16 AC 121 ms
55,476 KB
testcase_17 AC 122 ms
54,812 KB
testcase_18 AC 129 ms
54,056 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

import java.io.*;
import java.math.BigInteger;
import java.util.Arrays;

public class Main implements Runnable {
    static ContestScanner in;
    static Writer out;
    public static void main(String[] args) {
        new Thread(null, new Main(), "", 16 * 1024 * 1024).start();
    }

    public void run() {
        Main main = new Main();
        try {
            in = new ContestScanner();
            out = new Writer();
            main.solve();
            out.close();
            in.close();
        } catch (IOException e) {
            e.printStackTrace();
        }
    }

    void solve() throws IOException {
        char[] s = in.nextToken().toCharArray();
        int n = s.length;
        int[] height = new int[n + 1];
        final int base = 200000;
        height[0] = base;
        int[] table = new int[base * 2 + 1];
        Arrays.fill(table, -1);
        table[base] = 0;
        for (int i = 0; i < n; i++) {
            height[i + 1] = height[i] + (s[i] == 'A' ? 1 : -1);
            if (table[height[i + 1]] == -1) table[height[i + 1]] = i + 1;
        }
        int max = 0;
        for (int i = n; i >= 0; i--) {
            max = Math.max(max, i - table[height[i]]);
        }
        System.out.println(max);
    }
}

class Writer extends PrintWriter{
    public Writer(String filename)throws IOException
    {super(new BufferedWriter(new FileWriter(filename)));}
    public Writer()throws IOException {super(System.out);}
}
class ContestScanner implements Closeable {
    private BufferedReader in;private int c=-2;
    public ContestScanner()throws IOException
    {in=new BufferedReader(new InputStreamReader(System.in));}
    public ContestScanner(String filename)throws IOException
    {in=new BufferedReader(new InputStreamReader(new FileInputStream(filename)));}
    public String nextToken()throws IOException {
        StringBuilder sb=new StringBuilder();
        while((c=in.read())!=-1&&Character.isWhitespace(c));
        while(c!=-1&&!Character.isWhitespace(c)){sb.append((char)c);c=in.read();}
        return sb.toString();
    }
    public String readLine()throws IOException{
        StringBuilder sb=new StringBuilder();if(c==-2)c=in.read();
        while(c!=-1&&c!='\n'&&c!='\r'){sb.append((char)c);c=in.read();}
        return sb.toString();
    }
    public long nextLong()throws IOException,NumberFormatException
    {return Long.parseLong(nextToken());}
    public int nextInt()throws NumberFormatException,IOException
    {return(int)nextLong();}
    public double nextDouble()throws NumberFormatException,IOException
    {return Double.parseDouble(nextToken());}
    public void close() throws IOException {in.close();}
}
0