結果

問題 No.672 最長AB列
ユーザー GrenacheGrenache
提出日時 2018-04-21 19:37:56
言語 Java19
(openjdk 21)
結果
AC  
実行時間 784 ms / 2,000 ms
コード長 4,461 bytes
コンパイル時間 5,106 ms
コンパイル使用メモリ 75,140 KB
実行使用メモリ 55,360 KB
最終ジャッジ日時 2023-09-10 04:47:57
合計ジャッジ時間 10,325 ms
ジャッジサーバーID
(参考情報)
judge14 / judge15
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 43 ms
49,296 KB
testcase_01 AC 41 ms
49,356 KB
testcase_02 AC 43 ms
49,396 KB
testcase_03 AC 43 ms
49,508 KB
testcase_04 AC 42 ms
49,240 KB
testcase_05 AC 42 ms
49,168 KB
testcase_06 AC 41 ms
49,300 KB
testcase_07 AC 43 ms
49,436 KB
testcase_08 AC 44 ms
49,340 KB
testcase_09 AC 122 ms
54,120 KB
testcase_10 AC 126 ms
53,812 KB
testcase_11 AC 131 ms
54,852 KB
testcase_12 AC 493 ms
54,940 KB
testcase_13 AC 311 ms
54,472 KB
testcase_14 AC 631 ms
55,168 KB
testcase_15 AC 726 ms
55,360 KB
testcase_16 AC 784 ms
55,164 KB
testcase_17 AC 157 ms
55,004 KB
testcase_18 AC 122 ms
54,460 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

import java.io.*;
import java.util.*;


public class Main_yukicoder672 {

	private static Scanner sc;
	private static Printer pr;

	private static void solve() {
		char[] s = sc.next().toCharArray();
		int n = s.length;

		int[] cnta = new int[n + 1];
		for (int i = 0; i < n; i++) {
			cnta[i + 1] += cnta[i];
			if (s[i] == 'A') {
				cnta[i + 1]++;
			}
		}

		int max = 0;
		for (int i = 0; i < n; i++) {
			for (int j = i + (n - i) / 2 * 2; j > i; ) {
				int ca = cnta[j] - cnta[i];
				int cb = j - i - ca;
				if (ca - cb == 0) {
					max = Math.max(max, j - i);
					break;
				}
				j -= Math.abs(ca - cb);
			}
		}

		pr.println(max);
    }

	// ---------------------------------------------------
	public static void main(String[] args) {
		sc = new Scanner(INPUT == null ? System.in : new ByteArrayInputStream(INPUT.getBytes()));
		pr = new Printer(System.out);

		solve();

//		pr.close();
		pr.flush();
//		sc.close();
	}

	static String INPUT = null;

	@SuppressWarnings("unused")
	private static class Scanner {
		BufferedReader br;

		Scanner (InputStream in) {
			br = new BufferedReader(new InputStreamReader(in));
		}

		private boolean isPrintable(int ch) {
			return ch >= '!' && ch <= '~';
		}

		private boolean isCRLF(int ch) {
			return ch == '\n' || ch == '\r' || ch == -1;
		}

		private int nextPrintable() {
			try {
				int ch;
				while (!isPrintable(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}

				return ch;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		String next() {
			try {
				int ch = nextPrintable();
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (isPrintable(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		int nextInt() {
			try {
				// parseInt from Integer.parseInt()
				boolean negative = false;
				int res = 0;
				int limit = -Integer.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Integer.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				int multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		long nextLong() {
			try {
				// parseLong from Long.parseLong()
				boolean negative = false;
				long res = 0;
				long limit = -Long.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Long.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				long multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		float nextFloat() {
			return Float.parseFloat(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		String nextLine() {
			try {
				int ch;
				while (isCRLF(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (!isCRLF(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		void close() {
			try {
				br.close();
			} catch (IOException e) {
//				throw new NoSuchElementException();
			}
		}
	}

	private static class Printer extends PrintWriter {
		Printer(OutputStream out) {
			super(out);
		}
	}
}
0