1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
|
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<queue>
#include<map>
#include<stack>
#include<cmath>
#include<set>
#include<bitset>
#include<complex>
#include<assert.h>
#define inc(i,l,r) for(int i=l;i<=r;i++)
#define dec(i,l,r) for(int i=l;i>=r;i--)
#define link(x) for(edge *j=h[x];j;j=j->next)
#define mem(a) memset(a,0,sizeof(a))
#define ll long long
#define eps 1e-8
#define succ(x) (1<<x)
#define lowbit(x) (x&(-x))
#define sqr(x) ((x)*(x))
#define mid (x+y)/2
#define NM 100005
#define nm 30005
using namespace std;
const double pi=acos(-1);
const int inf=1e9+7;
ll read(){
ll x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f*x;
}
int n,a[NM],ans[NM],p[NM][3][3];
bool d[NM][3][3];
int med(int x,int y,int z){
if(x>y)swap(x,y);
if(x>z)swap(x,z);
if(y>z)swap(y,z);
return y;
}
int main(){
int _=read();while(_--){
n=read()-2;inc(i,1,n)a[i]=read();
inc(i,1,n+1)inc(j,0,2)inc(k,0,2)d[i][j][k]=false,p[i][j][k]=0;
d[1][1][2]=d[1][2][2]=true;
inc(i,1,n)inc(j,0,2)if(i+j-1>0&&i+j-1<=n)inc(k,0,2)if(i-1+k-1>0&&i-1+k-1<=n&&d[i][j][k]){
inc(v,0,2)if(i+1+v-1>0&&i+1+v-1<=n&&!d[i+1][v][j]&&med(a[i-1+k-1],a[i+j-1],a[i+1+v-1])==a[i]){
d[i+1][v][j]++;
p[i+1][v][j]=k;
}
}
ans[0]=-inf;
inc(j,0,2)inc(k,0,2)if(d[n+1][j][k]){
for(int x=n+1;x>1;x--){
ans[x]=a[x+j-1];
int t=p[x][j][k];
j=k;k=t;
}
ans[1]=a[1+j-1];
ans[0]=a[k-1];
break;
}
if(ans[0]<0){printf("-1\n");continue;}
inc(i,0,n)printf("%d ",ans[i]);printf("%d\n",ans[n+1]);
}
return 0;
}
|
