CodeForce Round 579 Div 3 A. Circle of Students

最新推荐文章于 2022-12-01 21:50:22 发布

__ChenShou__

最新推荐文章于 2022-12-01 21:50:22 发布

阅读量266

点赞数

分类专栏： CF

本文链接：https://blog.csdn.net/J_K_ang/article/details/99548052

版权

CF 专栏收录该内容

11 篇文章 0 订阅

订阅专栏

A. Circle of Students

Problem

There are $n$ students standing in a circle in some order. The index of the $i^{th}$ student is $p_i$ . 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 $ \left[ 2,3,4,5,1 \right]$, then they can start a clockwise round dance. If the students have indices $ \left[3,2,1,4\right]$ 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 $\leq q \leq 200)$ — the number of queries. Then $q$ queries follow.

The first line of the query contains one integer $\leq n \leq 200)$ — the number of students.

The second line of the query contains a permutation of indices $p_1,p_2,…,p_n (1 \leq p_i \leq n)$ , where $p_i$ 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

想法

暴力出奇迹

The Code Of My Program

/*********************
*@Author:   ChenShou *
*@Language: C++11    *
*********************/
//#include <bits/stdc++.h> 
#pragma comment(linker, "/STACK:102400000,102400000")
#include<functional>
#include<algorithm>
#include<iostream>
#include<cstdlib>
#include<cstring>
#include<sstream> 
#include<iomanip>
#include<numeric>
#include<cctype> 
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>

//#define DEBUG
#define RI register int
#define endl "\n"

using namespace std;
typedef long long ll;
//typedef __int128 lll;
//const int N=100000+10;
const int M=100000+10;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-9;
const int INF = 0x3f3f3f3f;

inline ll read(){
    long long x=0,f=1;
    char ch=getchar();
    while(ch<'0'||ch>'9'){
        if(ch=='-')
            f=-1;
        ch=getchar();
    }
    while(ch>='0'&&ch<='9'){
        x=(x<<1)+(x<<3)+(ch^48);
        ch=getchar();
    }
    return x*f; 
}

int main()
{
#ifdef DEBUG
    freopen("input.in", "r", stdin);
    //freopen("output.out", "w", stdout);
#endif
    //cout.tie(0);
    ll t=read() ; 
    
    while(t--){
    
    int n=read();
    int num [1000]={0},flag=0;
    for(int i=0;i<n;i++)num[i]=num[i+n]=read();
    for(int i=0;i<=2*n-1;i++){
    	if(num[i]==1){
    		int j=1;
			for(;j==num[i]&&(i>=0&&i<=2*n-1);i++,j++){
				if(j==n)flag=1;
			}
    	}
    }
    for(int i=2*n-1;i>=0;i--){
    	if(num[i]==1){
    		int k=1;
			for(;k==num[i]&&(i>=0&&i<=2*n-1);i--,k++){
				if(k==n)flag=1;
			}
    	}
    }
    if(flag){
    	printf("YES\n");
    	continue;
    }
    else {
    	printf("NO\n");
    	continue;
    }
}
#ifdef DEBUG
    printf("Time cost : %lf s\n",(double)clock()/CLOCKS_PER_SEC);
#endif
    //cout << "Fuck You !" << endl;
    return 0;
}