例题8-16(uva-1608)

#include <iostream>
#include <istream>
#include <sstream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>


#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
//using namespace std;
const int maxn = 2e5 + 7;
std::unordered_map<int, int> mmp;

int input[maxn], prev[maxn], next[maxn];

inline bool unique(int p, int L, int R) {
	return prev[p] < L && next[p] > R;
}

bool check(int L, int R) {
	if (L >= R) return true;
	for (int d = 0; L + d <= R - d; d++) {
		if (unique(L + d, L, R))
			return check(L, L + d - 1) && check(L + d + 1, R);
		if (L + d == R - d) break;
		if (unique(R - d, L, R))
			return check(R - d + 1, R) && check(L, R - d - 1);
	}
	return false;
}
int main()
{
	int t,n;
	std::cin >> t;
	while (t--) {
		std::cin >> n;
		mmp.clear();
		for (int i = 0; i < n; i++) {
			std::cin >> input[i];
			if (!mmp.count(input[i])) prev[i] = -1;
			else prev[i] = mmp[input[i]];
			mmp[input[i]] = i;
		}
		mmp.clear();
		for (int i = n - 1; i >= 0; i--) {
			if (!mmp.count(input[i])) next[i] = n;
			else next[i] = mmp[input[i]];
			mmp[input[i]] = i;
		}
		if (check(0, n - 1)) {
			std::cout << "non-boring" << std::endl;
		}
		else std::cout << "boring" << std::endl;
	}
	return 0;
}