HDU6197

array array array

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

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

 

 //2017-09-10
 #include <cstdio>
 #include <cstring>
 #include <iostream>
 #include <algorithm>

 using namespace std;

 const int N = ;
 int arr[N], rarr[N], n, k;
 int dp1[N], dp2[N];

 int Search(int* dp,int len,int num){
     int low = ,high = len;
     while(low <= high){
             int mid = (low + high) >> ;
             if (num == dp[mid]) return mid;
             if (dp[mid] < num) low = mid + ;
             else high = mid - ;
         }
     return low;
 }  

 int main()
 {
     int T;
     scanf("%d", &T);
     while(T--){
         scanf("%d%d", &n, &k);
         for(int i = ; i <= n; i++)
               scanf("%d", &arr[i]);
         for(int i = ; i <= n; i++)
               rarr[i] = arr[n-i+];
         int lis = ;
         dp1[] = -;
         dp1[] = arr[];
         for(int i = ; i <= n; i++){
             if(arr[i] > dp1[lis])
                   dp1[++lis] = arr[i];
             else{
                 int pos = Search(dp1, lis, arr[i]);
                 dp1[pos] = arr[i];
             }
         }
         int lds = ;
         dp2[] = -;
         dp2[] = rarr[];
         for(int i = ; i <= n; i++){
             if(rarr[i] > dp2[lds])
                   dp2[++lds] = rarr[i];
             else{
                 int pos = Search(dp2, lds, rarr[i]);
                 dp2[pos] = rarr[i];
             }
         }
         //printf("%d %d\n", lis, lds);
         if(n-k <= lis || n-k <= lds)
               printf("A is a magic array.\n");
         else
               printf("A is not a magic array.\n");
     }

     return ;
 }