hdu 沈阳选拔赛

array array array

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

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.

#include<iostream>
#include<string.h>
#include<algorithm>
using namespace std;
int main(){
    int n;
      cin>>n;
    while(n--){
        int m,t;
          cin>>m>>t;
        int j,k=0,l,i=0,r,mid;
        int a[100001];
        int dp[100001];
        for(j=0;j<m;j++){
            cin>>a[j];
        }
        memset(dp,10000009,sizeof(dp));

        dp[0]=a[0];
        for(j=1;j<m;j++){
           l=0;r=i;
          while(l<=r){
             mid=(l+r)/2;
             if(dp[mid]>a[j]) r=mid-1;
             else  l=mid+1;
          }
          if(i<l)
             i=l;
          dp[l]=a[j];
        }
        if(m-i-1<=t){
            cout<<"A is a magic array."<<endl;
        }
        else{
            cout<<"A is not a magic array."<<endl;
        }
    }
    return 0;
}