A. Circle of Students
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
There are n students standing in a circle in some order. The index of the i-th student is pi. It is guaranteed that all indices of students are distinct integers from 1 to n (i. e. they form a permutation).
Students want to start a round dance. A clockwise round dance can be started if the student 2 comes right after the student 1 in clockwise order (there are no students between them), the student 3 comes right after the student 2 in clockwise order, and so on, and the student n comes right after the student n−1 in clockwise order. A counterclockwise round dance is almost the same thing — the only difference is that the student i should be right after the student i−1 in counterclockwise order (this condition should be met for every i from 2 to n).
For example, if the indices of students listed in clockwise order are [2,3,4,5,1], then they can start a clockwise round dance. If the students have indices [3,2,1,4] in clockwise order, then they can start a counterclockwise round dance.
Your task is to determine whether it is possible to start a round dance. Note that the students cannot change their positions before starting the dance; they cannot swap or leave the circle, and no other student can enter the circle.
You have to answer q independent queries.
Input
The first line of the input contains one integer q (1≤q≤200) — the number of queries. Then q queries follow.
The first line of the query contains one integer n (1≤n≤200) — the number of students.
The second line of the query contains a permutation of indices p1,p2,…,pn (1≤pi≤n), where pi is the index of the i-th student (in clockwise order). It is guaranteed that all pi are distinct integers from 1 to n (i. e. they form a permutation).
Output
For each query, print the answer on it. If a round dance can be started with the given order of students, print “YES”. Otherwise print “NO”.
Example
input
5
4
1 2 3 4
3
1 3 2
5
1 2 3 5 4
1
1
5
3 2 1 5 4
output
YES
YES
NO
YES
YES
题意: t组样例,每个样例n个学生,对应1-n的编号,现给出编号序列,问是否可以使其围成圆圈,使其数字序列满足顺时针(从小到大)或逆时针(从大到小)。
思路: 先找出n的下标index,用vector数组分别存从index+1—n和1—index(即顺时针序列),再存一个index—n和1—index-1(即逆时针序列),再分别判断即可,详情看代码和注释。
#include <bits/stdc++.h>
using namespace std;
const int N = 2e2 + 10;
int a[N];
int main() {
int n, t, index;
scanf("%d", &t);
while (t--) {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
if (a[i] == n) index = i;
}
vector<int> v1, v2;
// v1存顺时针时的数据, v2存逆时针时的数据
for (int i = index + 1; i <= n; i++) {
v1.push_back(a[i]);
}
for (int i = 1; i <= index; i++) {
v1.push_back(a[i]);
}
for (int i = index; i <= n; i++) {
v2.push_back(a[i]);
}
for (int i = 1; i < index; i++) {
v2.push_back(a[i]);
}
int flag0 = 0, flag1 = 0;
for (int i = 0; i < n; i++) {
if (v1[i] != i + 1) { // 不满足顺时针的规律,标记
flag0 = 1;
break;
}
}
for (int i = 0; i < n; i++) {
if (v2[i] != n - i) { // 不满足逆时针的规律,标记
flag1 = 1;
break;
}
}
if (flag0 && flag1) printf("NO\n");
else printf("YES\n");
}
return 0;
}