結果

問題 No.588 空白と回文
ユーザー hiromi_ayase
提出日時 2017-11-03 22:36:06
言語 Java8
(openjdk 1.8.0.191)
結果
AC  
実行時間 91 ms
コード長 2,669 Byte
コンパイル時間 1,734 ms
使用メモリ 24,448 KB
最終ジャッジ日時 2018-11-10 10:20:56

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
0.txt AC 87 ms
22,492 KB
1.txt AC 84 ms
23,400 KB
2.txt AC 84 ms
21,852 KB
3.txt AC 90 ms
24,328 KB
4.txt AC 85 ms
23,612 KB
5.txt AC 85 ms
21,772 KB
6.txt AC 85 ms
23,452 KB
7.txt AC 85 ms
24,292 KB
8.txt AC 86 ms
24,292 KB
9.txt AC 86 ms
23,940 KB
10.txt AC 86 ms
21,488 KB
11.txt AC 91 ms
23,516 KB
12.txt AC 90 ms
24,448 KB
13.txt AC 85 ms
23,356 KB
14.txt AC 85 ms
24,256 KB
15.txt AC 85 ms
22,416 KB
16.txt AC 84 ms
22,888 KB
17.txt AC 89 ms
23,192 KB
18.txt AC 86 ms
23,964 KB
19.txt AC 84 ms
23,128 KB
20.txt AC 91 ms
23,796 KB
21.txt AC 91 ms
23,148 KB
22.txt AC 89 ms
21,548 KB
23.txt AC 90 ms
22,920 KB
24.txt AC 84 ms
23,172 KB
テストケース一括ダウンロード

ソースコード

diff #
public class Main {

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

		int max = 0;
		for (int i = 0; i < n; i ++) {
			int now = 0;
			//odd
			for (int j = 0; j < i; j ++) {
				if (i * 2 - j < n && s[j] == s[i * 2 - j]) {
					now ++;
				}
			}
			max = Math.max(now * 2 + 1, max);
			now = 0;
			for (int j = 0; j <= i; j ++) {
				if ((i + 1) * 2 - j - 1 < n && s[j] == s[(i + 1) * 2 - j - 1]) {
					now ++;
				}
			}
			max = Math.max(now * 2, max);
		}
		System.out.println(max);
	}

	public static void main(String[] args) {
		new Thread(null, new Runnable() {
			@Override
			public void run() {
				long start = System.currentTimeMillis();
				String debug = args.length > 0 ? args[0] : null;
				if (debug != null) {
					try {
						is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
					} catch (Exception e) {
						throw new RuntimeException(e);
					}
				}
				reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
				solve();
				out.flush();
				tr((System.currentTimeMillis() - start) + "ms");
			}
		}, "", 64000000).start();
	}

	private static java.io.InputStream is = System.in;
	private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
	private static java.util.StringTokenizer tokenizer = null;
	private static java.io.BufferedReader reader;

	public static String next() {
		while (tokenizer == null || !tokenizer.hasMoreTokens()) {
			try {
				tokenizer = new java.util.StringTokenizer(reader.readLine());
			} catch (Exception e) {
				throw new RuntimeException(e);
			}
		}
		return tokenizer.nextToken();
	}

	private static double nd() {
		return Double.parseDouble(next());
	}

	private static long nl() {
		return Long.parseLong(next());
	}

	private static int[] na(int n) {
		int[] a = new int[n];
		for (int i = 0; i < n; i++)
			a[i] = ni();
		return a;
	}

	private static char[] ns() {
		return next().toCharArray();
	}

	private static long[] nal(int n) {
		long[] a = new long[n];
		for (int i = 0; i < n; i++)
			a[i] = nl();
		return a;
	}

	private static int[][] ntable(int n, int m) {
		int[][] table = new int[n][m];
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				table[i][j] = ni();
			}
		}
		return table;
	}

	private static int[][] nlist(int n, int m) {
		int[][] table = new int[m][n];
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				table[j][i] = ni();
			}
		}
		return table;
	}

	private static int ni() {
		return Integer.parseInt(next());
	}

	private static void tr(Object... o) {
		if (is != System.in)
			System.out.println(java.util.Arrays.deepToString(o));
	}
}
0