RestoretheArray.cpp

/* 
AUTHOR: Antarikshya Mitra
TIME: 
PROBLEM NO:-  Restore the Array Div2 C
*/


#include<bits/stdc++.h>
using namespace std;
#define int long long 
#define endl '\n'
const int MOD = 1e9 + 7; 

void solve(vector<int> &arr)
{
	int n = arr.size();
	vector<int> ans(n+1);
	ans[n] = arr[n-1];
	int i = n-1;
	while(i>=0)
	{
		if(i>0 && arr[i-1]<=arr[i])
			ans[i] = arr[i-1];
		else if(i>0 && arr[i-1]>arr[i])
			ans[i] = arr[i];
		else if(i==0) ans[0] = arr[0];
		i--;
	}
	for(int &x:ans)
		cout<<x<<" ";
	cout<<endl;
	return;
}

int32_t main()
{
	ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
	int t=1;
	cin>>t;
	while(t--)
	{
		int n;
		cin>>n;
		vector<int> arr(n-1);
		for (auto &a:arr) 
			cin>>a;
		solve(arr);
	}	
	return 0;
}