結果

問題 No.672 最長AB列
ユーザー tutuztutuz
提出日時 2018-09-13 23:24:29
言語 Java21
(openjdk 21)
結果
AC  
実行時間 403 ms / 2,000 ms
コード長 3,568 bytes
コンパイル時間 2,614 ms
コンパイル使用メモリ 83,768 KB
実行使用メモリ 87,312 KB
最終ジャッジ日時 2024-07-01 04:33:40
合計ジャッジ時間 9,104 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 188 ms
74,404 KB
testcase_01 AC 190 ms
74,232 KB
testcase_02 AC 187 ms
74,444 KB
testcase_03 AC 181 ms
74,460 KB
testcase_04 AC 194 ms
74,600 KB
testcase_05 AC 193 ms
74,572 KB
testcase_06 AC 200 ms
74,236 KB
testcase_07 AC 198 ms
74,436 KB
testcase_08 AC 196 ms
74,760 KB
testcase_09 AC 394 ms
87,312 KB
testcase_10 AC 374 ms
81,488 KB
testcase_11 AC 336 ms
82,088 KB
testcase_12 AC 334 ms
81,240 KB
testcase_13 AC 380 ms
81,648 KB
testcase_14 AC 361 ms
81,828 KB
testcase_15 AC 381 ms
81,108 KB
testcase_16 AC 376 ms
81,620 KB
testcase_17 AC 403 ms
82,032 KB
testcase_18 AC 370 ms
80,520 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.List;
import java.util.StringTokenizer;
import java.util.stream.Stream;

public class Main {

	public static void main(String[] args) throws IOException {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskX solver = new TaskX();
		solver.solve(1, in, out);
		out.close();
	}

	static int INF = 1 << 30;
	static long LINF = 1L << 55;
	static int MOD = 1000000007;
	static int[] mh4 = { 0, -1, 1, 0 };
	static int[] mw4 = { -1, 0, 0, 1 };
	static int[] mh8 = { -1, -1, -1, 0, 0, 1, 1, 1 };
	static int[] mw8 = { -1, 0, 1, -1, 1, -1, 0, 1 };

	@SuppressWarnings("unchecked")
	static class TaskX {

		public void solve(int testNumber, InputReader in, PrintWriter out) {

			char[] s = in.nextString().toCharArray();
			int pad = 200010;
			int n = s.length;
			int[] sum = new int[n+1];
			for (int i = 0; i < n; i++) {
				if (s[i] == 'A') {
					sum[i+1] = 1;
				} else if (s[i] == 'B') {
					sum[i+1] = -1;
				}
			}
			Arrays.parallelPrefix(sum, Math::addExact);

			List<Integer>[] g = new ArrayList[3*pad];
			g = Stream.generate(ArrayList::new).limit(3*pad).toArray(List[]::new);
			for (int i = 0; i < n+1; i++) {
				g[sum[i]+pad].add(i);
			}

			int ans = 0;
			for (List<Integer> list : g) {
				if (list.size() <= 1) continue;
				int m = list.size();
				ans = Math.max(ans, list.get(m-1) - list.get(0));
			}

			out.println(ans);
		}
	}

	static class InputReader {
		BufferedReader in;
		StringTokenizer tok;

		public String nextString() {
			while (!tok.hasMoreTokens()) {
				try {
					tok = new StringTokenizer(in.readLine(), " ");
				} catch (IOException e) {
					throw new InputMismatchException();
				}
			}
			return tok.nextToken();
		}

		public int nextInt() {
			return Integer.parseInt(nextString());
		}

		public long nextLong() {
			return Long.parseLong(nextString());
		}

		public double nextDouble() {
			return Double.parseDouble(nextString());
		}

		public int[] nextIntArray(int n) {
			int[] res = new int[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextInt();
			}
			return res;
		}

		public int[] nextIntArrayDec(int n) {
			int[] res = new int[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextInt() - 1;
			}
			return res;
		}

		public int[] nextIntArray1Index(int n) {
			int[] res = new int[n + 1];
			for (int i = 0; i < n; i++) {
				res[i + 1] = nextInt();
			}
			return res;
		}

		public long[] nextLongArray(int n) {
			long[] res = new long[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextLong();
			}
			return res;
		}

		public long[] nextLongArrayDec(int n) {
			long[] res = new long[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextLong() - 1;
			}
			return res;
		}

		public long[] nextLongArray1Index(int n) {
			long[] res = new long[n + 1];
			for (int i = 0; i < n; i++) {
				res[i + 1] = nextLong();
			}
			return res;
		}

		public double[] nextDoubleArray(int n) {
			double[] res = new double[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextDouble();
			}
			return res;
		}

		public InputReader(InputStream inputStream) {
			in = new BufferedReader(new InputStreamReader(inputStream));
			tok = new StringTokenizer("");
		}
	}

}
0