[BOJ] 10942번 : 팰린드롬?

1. problem : 

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

 

2. solution1 :

#include <bits/stdc++.h>
using namespace std;
int n; 
int nums[2005]; 
int d[2005][2005]; // i부터 j까지의 palindrome 여부 기록; 

int main(void) {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> nums[i];
		d[i][i] = 1;
		if (nums[i] == nums[i - 1]) d[i - 1][i] = 1;
	}
	for (int gap = 2; gap < n; gap++) {
		for (int i = 1; i <= n - gap; i++) {
			int s = i, e = i + gap; 
			if (nums[s] == nums[e] && d[s + 1][e - 1]) d[s][e] = 1;
		}
	}
	int t; 
	cin >> t;
	while (t--) {
		int s, e; 
		cin >> s >> e; 
		cout << d[s][e] << '\n';
	}
}

source code 출처 : https://github.com/encrypted-def/basic-algo-lecture/blob/master/0x10/solutions/10942.cpp

basic-algo-lecture/0x10/solutions/10942.cpp at master · encrypted-def/basic-algo-lecture