Hdu 6197 array, hdu6197array
Array
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission (s): 459 Accepted Submission (s): 282
Problem DescriptionOne 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 cocould give a right answer, Kiddo wocould 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?
InputThe 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
OutputFor 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 Input34 11 4 3 75 24 1 1 26 11 4 3 5 4 6
Sample OutputA is a magic array. A is a magic array. A is not a magic array.
After converting Source 2017 ACM/ICPC Asia Regional Shenyang Online, the length of the longest ascending sub-sequence is obtained. In addition, we found a two-point LIS method.
#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<queue>#include<vector>#include<cmath>#include<string>#define LL long long const int maxn=1e5+5;using namespace std;int a[maxn],b[maxn],c[maxn];int n;int LIS(int *d){ memset(c,0,sizeof(c)); c[1]=d[1]; int l,r,mid,len=1; for(int i=2;i<=n;i++){ l=1; r=len; while(l<=r){ mid=(l+r)/2; if(c[mid]<=d[i]) l=mid+1; else r=mid-1; } c[l]=d[i]; if(l>len) len++; } return len;}int main(){ int T; scanf("%d",&T); int k; while(T--) { scanf("%d%d",&n,&k); for(int i=1;i<=n;i++) { scanf("%d",&a[i]); b[i]=-a[i]; } int maxn=max(LIS(a),LIS(b)); if(n-maxn>k) printf("A is not a magic array.\n"); else printf("A is a magic array.\n"); } return 0;}