#include "gondola.h" int ch[100010],visit[250010]; int valid(int n, int inputSeq[]) { int i,k=0; for(i=0;i<n;i++) { if(visit[inputSeq[i]]==1) return 0; visit[inputSeq[i]]=1; if(inputSeq[i]<=n) ch[inputSeq[i]]=i; } for(i=1;i<=n;i++) { if(ch[i]!=0 && k==0) { k=ch[i]; continue; } if(k!=0) { k++; if(k>n) k=1; } if(ch[i]!=0 && k!=ch[i]) return 0; } return 1; } //---------------------- int replacement(int n, int gondolaSeq[], int replacementSeq[]) { return -2; } //---------------------- int countReplacement(int n, int inputSeq[]) { return -3; }