题解 | #有序序列判断#vector 大法好
有序序列判断
https://www.nowcoder.com/practice/22e87f8a8d764a6582710f38d1b40c6e
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int num;
vector<int> vec1, vec2, vec3;
while (cin >> num) {
vec1.push_back(num);
vec2.push_back(num);
vec3.push_back(num);
}
sort(vec2.begin(), vec2.end());
sort(vec3.rbegin(), vec3.rend());
if (vec1 == vec2 || vec1 == vec3)
cout << "sorted" << endl;
else
cout << "unsorted" << endl;
}
// 64 位输出请用 printf("%lld")
