Consecutive Points Segment

最新推荐文章于 2024-11-09 13:08:09 发布

张小呆QAQ

最新推荐文章于 2024-11-09 13:08:09 发布

阅读量151

点赞数

文章标签：开发语言 c++ 算法

本文链接：https://blog.csdn.net/hacker_hao/article/details/131835741

版权

Consecutive Points Segment

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given nn points with integer coordinates on a coordinate axis OXOX. The coordinate of the ii-th point is xixi. All points' coordinates are distinct and given in strictly increasing order.

For each point ii, you can do the following operation no more than once: take this point and move it by 11 to the left or to the right (i..e., you can change its coordinate xixi to xi−1xi−1 or to xi+1xi+1). In other words, for each point, you choose (separately) its new coordinate. For the ii-th point, it can be either xi−1xi−1, xixi or xi+1xi+1.

Your task is to determine if you can move some points as described above in such a way that the new set of points forms a consecutive segment of integers, i. e. for some integer ll the coordinates of points should be equal to l,l+1,…,l+n−1l,l+1,…,l+n−1.

Note that the resulting points should have distinct coordinates.

You have to answer tt independent test cases.

Input

The first line of the input contains one integer tt (1≤t≤2⋅1041≤t≤2⋅104) — the number of test cases. Then tt test cases follow.

The first line of the test case contains one integer nn (1≤n≤2⋅1051≤n≤2⋅105) — the number of points in the set xx.

The second line of the test case contains nn integers x1<x2<…<xnx1<x2<…<xn (1≤xi≤1061≤xi≤106), where xixi is the coordinate of the ii-th point.

It is guaranteed that the points are given in strictly increasing order (this also means that all coordinates are distinct). It is also guaranteed that the sum of nn does not exceed 2⋅1052⋅105 (∑n≤2⋅105∑n≤2⋅105).

Output

For each test case, print the answer — if the set of points from the test case can be moved to form a consecutive segment of integers, print YES, otherwise print NO.

Example

input

output

YES
YES
NO
YES
YES

#include<bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int a[N];
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);

    int t, n;
    cin >> t;
    while(t--)
    {
        cin >> n;
        for(int i = 0;i < n ;i++)
            cin >> a[i];
        int k = n - 2;//中间的数字的个数
        int ans = a[n - 1] - a[0] - 2 - 1;//比较两边的距离和中间数字的个数
        //如1 2 3 7    1,7变为2,6中间如果有3(6-2-1)个数的话就为YES
        if(ans <= k)
            cout << "YES" <<endl;
        else
            cout << "NO" << endl;

    }
    return 0;
}