Hdu6197 array array array

array array array

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 130    Accepted Submission(s): 72

Problem Description

One day, Kaitou Kiddo had stolen a priceless diamond ring. But detective Conan blocked Kiddo's path to escape from the museum. But Kiddo didn't want to give it back. So, Kiddo asked Conan a question. If Conan could give a right answer, Kiddo would return the ring to the museum. 
Kiddo: "I have an array  A  and a number  k , if you can choose exactly  k  elements from  A  and erase them, then the remaining array is in non-increasing order or non-decreasing order, we say  A  is a magic array. Now I want you to tell me whether  A  is a magic array. " Conan: "emmmmm..." Now, Conan seems to be in trouble, can you help him?

 

Input

The first line contains an integer T indicating the total number of test cases. Each test case starts with two integers  n  and  k  in one line, then one line with  n  integers:  A1,A2…An .
1≤T≤20
1≤n≤105
0≤k≤n
1≤Ai≤105

 

Output

For each test case, please output "A is a magic array." if it is a magic array. Otherwise, output "A is not a magic array." (without quotes).

 

Sample Input

  
  

   
   3
4 1
1 4 3 7
5 2
4 1 3 1 2
6 1
1 4 3 5 4 6
  
  

 

Sample Output

  
  

   
   A is a magic array.
A is a magic array.
A is not a magic array.
  
  

 

Source

2017 ACM/ICPC Asia Regional Shenyang Online

——————————————————————————————————

题目的意思是给出一个序列问能否去掉k的数之后使得整个序列不是递增也不是递减的

思路：先求出LIS，然后倒序求出最长递减子序列长度，然后判断去k的数后长度是否都大于所求长度

#include <bits/stdc++.h>
using namespace std;

int a[100005];
int b[100005];
int jl[100005];
int n,m,T;

int main()
{
 for(scanf("%d",&T);T--;)
 {
    scanf("%d %d",&n,&m);
    for(int i=0;i<n;i++)
    {
        scanf("%d",&a[i]);
    }
    jl[0] = a[0];
    int len = 1;
    int tj;
    for(int i = 1; i < n; i++)
    {
        if(jl[len - 1] <= a[i])
        {
            jl[len++] = a[i];
        }
        else
        {
            tj = upper_bound(jl, jl + len, a[i]) - jl;
            jl[tj] = a[i];
        }
    }
    int al = len;
    for(int i = 0; i < n; i++)
        b[i] = a[n - i];
    jl[0] = b[0];
    len = 1;
    for(int i = 1; i < n; i++)
    {
        if(jl[len - 1] <= b[i])
        {
            jl[len++] = b[i];
        }
        else
        {
            tj = upper_bound(jl, jl + len, b[i]) - jl;
            jl[tj] = b[i];
        }
    }
    int bl = len;
    if(n - m > al && n - m > bl)
        printf("A is not a magic array.\n");
    else
        printf("A is a magic array.\n");
 }
  return 0;
}