#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <climits>
#include <cmath>
#include <fstream>
#include <queue>
//#include "gondola.h"
using namespace std;
int valid(int n, int inputSeq[]) {
int minValue = INT_MAX, idx = 0;
for (int i = 0; i < n; i++) {
minValue = min(minValue, inputSeq[i]);
if (minValue == inputSeq[i]) {
idx = i;
}
}
int maxLess = 0, maxBig = 0;
rotate(inputSeq, inputSeq + idx, inputSeq + n);
for (int i = 0; i < n; i++) {
if (inputSeq[i] <= n) {
maxLess = max(maxLess, inputSeq[i]);
if (maxLess != inputSeq[i]) {
return 0;
}
}
else {
maxBig = max(maxBig, inputSeq[i]);
if (maxBig != inputSeq[i]) {
return 0;
}
}
}
return 1;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
return 0;
}
int countReplacement(int n, int inputSeq[]) {
return 0;
}
Compilation message
/tmp/ccTWa49m.o: In function `main':
grader.cpp:(.text.startup+0xa2): undefined reference to `valid'
grader.cpp:(.text.startup+0xee): undefined reference to `countReplacement'
grader.cpp:(.text.startup+0x112): undefined reference to `replacement'
collect2: error: ld returned 1 exit status
