Pagini recente » Arhiva de probleme | Cod sursa (job #2331269) | Cod sursa (job #1505296) | Istoria paginii utilizator/ana.marginean97 | Cod sursa (job #2188839)
#include <fstream>
#define NM 250003
using namespace std;
ifstream f("salturi.in");
ofstream g("salturi.out");
int k,i,n,ok,max1,s,j;
long long v[NM],cr[NM],x[NM];
int main()
{
f>>k;
for(i=1;i<=k;i++){
f>>n;
ok=1; max1=n-1;
for(j=1;j<=n&&ok==1;j++){
f>>s; x[j]=s;
if((x[j]==x[j-1]&&x[j]!=1)||(x[j]<x[j-1]&&x[j]!=1)) ok=0;
else{
if(s>j) ok=0;
else{
if(s==1) { v[j]=max1+1; cr[j]=1; max1++; }
else {
if(s-1>cr[j-1]) ok=0;
else{
v[j]=v[j-1]-1; cr[j]=cr[j-1]+1;
}
}
}
}
}
if(ok==0) g<<-1<<'\n';
else {
for(j=1;j<=n;j++){ g<<v[j]<<' '; v[j]=0; cr[j]=0; }
g<<'\n';
}
}
return 0;
}