https://cn.vjudge.net/problem/UVA-1608
#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
#include <unordered_map>
#include <cmath>
#include<bits/stdc++.h>
using namespace std;
#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 8e19
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
template<typename T>inline void read(T &x)
{
x=0;
static int p;p=1;
static char c;c=getchar();
while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
x*=p;
}
//-----------------------------------------------
const int maxn=2e5+9;
const int maxm=2e5+9;
const int mod=1e6+3;
int pre[maxn],lat[maxn];
int n,m;
int a[maxn];
map<int,int>mp;
bool ch(int L,int R)
{
if(L>=R) return 1;
int l=L,r=R;
for(int i=L;i<=R;i++)
{
if(i&1)
{
if(pre[l]<L&&lat[l]>R)
{
return ch(L,l-1)&&ch(l+1,R);
}
l++;
}
else
{
if(pre[r]<L&&lat[r]>R)
{
return ch(L,r-1)&&ch(r+1,R);
}
r--;
}
}
return 0;
}
int main()
{
//FAST_IO;
freopen("input.txt","r",stdin);
int T;
cin>>T;
while(T--)
{
for(int i=0;i<=n;i++) pre[i]=lat[i]=0;
mp.clear();
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a[i];
}
for(int i=0;i<=n;i++)
{
lat[mp[a[i]]]=i;
pre[i]=mp[a[i]];
mp[a[i]]=i;
}
for(int i=1;i<=n;i++) lat[mp[a[i]]]=n+1;
for(int i=1;i<=n;i++)
{
cout<<a[i]<<" "<<pre[i]<<" "<<lat[i]<<endl;
}
fl();
if(ch(1,n))
{
cout<<"non-boring"<<endl;
}
else cout<<"boring"<<endl;;
}
return 0;
}