#include<bits/stdc++.h> #include "gondola.h" using namespace std; int Can(int n, int a[]) { sort ( a , a + n); for (int i = 1; i < n; i ++) if ( a[i] == a[i - 1]) return 0; return 1; } int valid(int n, int a[]) { int cnt = 0, mn = n, ind = 0; if (!Can(n, a)) return 0; for (int i = 0; i < n; i ++) { if ( a[i] <=n) { cnt ++; if ( mn >= a[i]) { mn = a[i]; ind = i; } } } if ( cnt == 0) return 1; int last = 0; for (int j = 0; j < n; j ++) { if ( a[ind] > last) { last = a[ind]; cnt --; } ind = (ind + 1) % n; } if ( cnt == 0) return 1; return 0; } //---------------------- int replacement(int n, int gondolaSeq[], int replacementSeq[]) { return -2; } //---------------------- int countReplacement(int n, int inputSeq[]) { return -3; }