Codeforces Round #656 (Div. 3)C. Make It Good【找规律】

题目

传送门
You are given an array a consisting of n integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from a to make it a good array. Recall that the prefix of the array a=[a1,a2,…,an] is a subarray consisting several first elements: the prefix of the array a of length k is the array [a1,a2,…,ak] (0≤k≤n).

The array b of length m is called good, if you can obtain a non-decreasing array c (c1≤c2≤⋯≤cm) from it, repeating the following operation m times (initially, c is empty):

select either the first or the last element of b, remove it from b, and append it to the end of the array c.
For example, if we do 4 operations: take b1, then bm, then bm−1 and at last b2, then b becomes [b3,b4,…,bm−3] and c=[b1,bm,bm−1,b2].

Consider the following example: b=[1,2,3,4,4,2,1]. This array is good because we can obtain non-decreasing array c from it by the following sequence of operations:

take the first element of b, so b=[2,3,4,4,2,1], c=[1];
take the last element of b, so b=[2,3,4,4,2], c=[1,1];
take the last element of b, so b=[2,3,4,4], c=[1,1,2];
take the first element of b, so b=[3,4,4], c=[1,1,2,2];
take the first element of b, so b=[4,4], c=[1,1,2,2,3];
take the last element of b, so b=[4], c=[1,1,2,2,3,4];
take the only element of b, so b=[], c=[1,1,2,2,3,4,4] — c is non-decreasing.
Note that the array consisting of one element is good.

Print the length of the shortest prefix of a to delete (erase), to make a to be a good array. Note that the required length can be 0.

You have to answer t independent test cases.

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

The first line of the test case contains one integer n (1≤n≤2⋅105) — the length of a. The second line of the test case contains n integers a1,a2,…,an (1≤ai≤2⋅105), where ai is the i-th element of a.

It is guaranteed that the sum of n does not exceed 2⋅105 (∑n≤2⋅105).

Output
For each test case, print the answer: the length of the shortest prefix of elements you need to erase from a to make it a good array.

题意：t组样例，每组n个数字，下面是b数组，数组中有n个数，问删掉前几个数可以从b中每次从末尾或开头取一个数放到c数组中使c为非递减数列？

思路本来想的是只要两边的数大于中间的数就是答案但是错了，后来想到 8 2 2 8 发现要满足a[i]<a[i-1]&&a[i]<=a[i+1] (多了一个等号)，还是错了后面又想到 8 2 2 2 1 1 发现要先从后往前遍历一下得到第一个a[i-1]<a[i]的位置，再用a[i]<a[i-1]&&a[i]<=a[i+1] ，然后过了…

AC code

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<sstream>
#include<queue>
#include<stack>
#include<vector>
#define inf 0x3f3f3f3f
using namespace std;
int a[250000];
void solve()
{
   int n;
   cin>>n;
   for(int i=1;i<=n;i++)
     cin>>a[i];
   if(n==1||n==2)printf("0\n");
      else
      {   int q=n-1;
          while(a[q]>=a[q+1]&&q>=1)
          {
              q--;
          }
          int p=1;
          for(int i=2;i<=q;i++)
            if(a[i]<=a[i+1]&&a[i]<a[i-1])p=i;
          printf("%d\n",p-1);
      }
}
int main()
{
    ios::sync_with_stdio(0);
    int t;
    cin>>t;
    while(t--)
        solve();
}