2015长春赛 Almost Sorted Array

最新推荐文章于 2020-08-05 08:57:53 发布

_大太阳_

最新推荐文章于 2020-08-05 08:57:53 发布

阅读量856

点赞数 1

分类专栏：胡搞

本文链接：https://blog.csdn.net/w144215160044/article/details/49558533

版权

胡搞专栏收录该内容

17 篇文章 0 订阅

订阅专栏

http://acm.hdu.edu.cn/contests/contest_showproblem.php?cid=646&pid=1006

Almost Sorted Array

Problem Description

We are all familiar with sorting algorithms: quick sort, merge sort, heap sort, insertion sort, selection sort, bubble sort, etc. But sometimes it is an overkill to use these algorithms for an almost sorted array.

We say an array is sorted if its elements are in non-decreasing order or non-increasing order. We say an array is almost sorted if we can remove exactly one element from it, and the remaining array is sorted. Now you are given an array

a1,a2,…,an , is it almost sorted?

Input

The first line contains an integer

T indicating the total number of test cases. Each test case starts with an integer

n in one line, then one line with

n integers

a1,a2,…,an .

1≤T≤2000

2≤n≤105

1≤ai≤105
There are at most 20 test cases with

n>1000 .

Output

For each test case, please output "`YES`" if it is almost sorted. Otherwise, output "`NO`" (both without quotes).

Sample Input

Sample Output

  
  
   
   YES
YES
NO

数据范围比较大，所以不能用双重for循环

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <limits>
#include <queue>
#include <stack>
#include <vector>
#include <map>

using namespace std;


#define N 240000
#define INF 0x3f3f3f3f
#define PI acos (-1.0)
#define EPS 1e-8
#define met(a, b) memset (a, b, sizeof (a))

const int dir[4][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};

typedef long long LL;

int a[N];

int main ()
{
    int t, n;
    scanf ("%d", &t);

    while (t--)
    {
        int flag = 0;

        scanf ("%d", &n);

        for (int i=0; i<n; i++)
            scanf ("%d", &a[i]);

        int p = 0, q = 0, Index = 1, cnt = 0;

        for (int i=1; i<n; i++)//判断上升序列
        {
            if (a[i] >= a[i-1])
                p++;
            else
            {
                Index = i;
                cnt++;
            }
        }

        if (p == n-1) flag = 1;

        if (cnt == 1)
        {
            if (Index == 1 || Index == n-1 || a[Index-1]<=a[Index+1] || a[Index-2]<=a[Index])
                flag = 1;
        }

        cnt = 0, Index = 1;
        for (int i=1; i<n; i++)//判断下降序列
        {
            if (a[i] <= a[i-1])
                q++;
            else
            {
                Index = i;
                cnt++;
            }
        }

        if (q == n-1) flag = 1;

        if (cnt == 1)
        {
            if (Index == 1 || Index == n-1 || a[Index-1]>=a[Index+1] || a[Index-2]>=a[Index])
                flag = 1;
        }

        if (flag) puts ("YES");
        else puts ("NO");
    }
    return 0;
}