BEAKJOON JAVA ALGORITHM #10942(팰린드롬?)

https://www.acmicpc.net/problem/10942

import java.util.Scanner; public class a10942 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int num = sc.nextInt(); int[] arr = new int[num+1]; for(int i=1; i<=num; i++) { arr[i] = sc.nextInt(); } int num2 = sc.nextInt(); StringBuilder result = new StringBuilder(); for(int i=0; i<num2; i++) { int p = sc.nextInt(); int q = sc.nextInt(); int r = 0; for(int j=0; j<=q-p; j++) { if(p+j <= q-j) { if(arr[p+j] == arr[q-j]) { r = 1; }else { r = 0; break; } } } result.append(Integer.toString(r)+"\n"); } System.out.println(result); } }