HDU 6197 array array array(最长不下降子序列)
来源:互联网 发布:dnf淘宝买金币安全吗 编辑:程序博客网 时间:2024/05/29 08:41
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 arrayA 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?
Kiddo: "I have an array
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
34 11 4 3 75 24 1 3 1 26 11 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
Recommend
liuyiding
题解:
这是比赛我做出的第一题。。比较简单,直接正着和反着求一遍最长不下降子序列,然后把总长减去序列长度和k比较一下就行了
然后一开始我tle了。。。后来改成nlogn的做法就ac了
代码没有了。。。hdu不允许提出来我的忘记存了
阅读全文
0 0
- HDU 6197 array array array(最长不下降子序列)
- hdu 6197array array array(最长不下降子序列nlogn)
- HDU 6197 array array array(最长上升或下降子序列)
- hdu 5532 Almost Sorted Array(最长上升(不下降)子序列和最长下降(不上升)子序列)
- 【2017沈阳网络赛】1004 hdu6197 array array array 最长不下降子序列
- HDU 5532 Almost Sorted Array(最长不下降子序列nlogn模板)
- HDU 6197 array array array (2017沈阳网赛- 最长上升子序列)
- hdu-6197 array array array(最长上升子序列(LIS)长度的O(nlogn)算法)
- hdu 6197 array array array (LIS,最长上升子序列模板题)
- [hdu 5532] [2015ACM/ICPC亚洲区长春站 ] Almost Sorted Array 最长不下降子序列
- array array array (最长上升子序列变形)
- HDU5532 Almost Sorted Array(最长不上升子序列)
- hdu 5532 Almost Sorted Array(最长不上升子序列、暴力)
- hdu 5532 Almost Sorted Array 最长上升子序列
- hdu6197array array array(最长上升子序列二分版)
- hdu 6197 array array array
- HDU 6197 array array array
- HDU6197 array array array 最长上升子序列(模板题)
- 二叉树遍历——转载于网易博客summer
- phpdoc
- 2017-09-10 LeetCode_020 Valid Parentheses
- java volatile关键字的用法
- Qt 线程同步之 QWaitCondition
- HDU 6197 array array array(最长不下降子序列)
- 递归汉诺塔
- 利用nat123实现公网访问内网
- PHP 常量
- restful
- 尺取法
- QMainWindow布局
- 无法注入XXXMapper
- xor