HDU 6197 LIS

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

4000
const int N = 1e5+10;

int t, n, k;
vector<int> V;

namespace LIS{
int dp
;
bool solve() {
int len = 0;
for(int i = 1; i <= n; i++) {
int v = V[i];
auto pos = upper_bound(dp+1, dp+1+len, v) - dp;
if(pos == len + 1) len++;
dp[pos] = v;
}
return len >= n - k;
}
}

int main() {
scanf("%d", &t);
while(t--) {
scanf("%d%d", &n, &k);
V.clear();
V.push_back(0);
for(int i = 1; i <= n; i++) {
int v;
scanf("%d", &v);
V.push_back(v);
}
bool ans = 0;
ans |= LIS::solve();
for(int i = 0; i < V.size(); i++) V[i] = -V[i];
ans |= LIS::solve();
puts(ans?"A is a magic array.":"A is not a magic array.");
}
return 0;
}