传送门
题意
给你一个序列,删去若干个数之后能否保证至少有 k k k个数满足 a i = i a_i = i ai=i
分析
f [ i ] [ j ] f[i][j] f[i][j]表示前 i i i个数字删去 j j j个后有多少个数字满足条件,然后 n 2 n ^ 2 n2转移即可
代码
#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 2e3 + 10;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
int a[N];
int f[N][N];
int n,k;
int main() {
int T;
read(T);
while(T--){
memset(f,0,sizeof f);
read(n),read(k);
for(int i = 1;i <= n;i++) read(a[i]);
for(int i = 1;i <= n;i++)
for(int j = 0;j <= i;j++){
if(!j) f[i][j] = f[i - 1][j] + (a[i] == i);
else f[i][j] = max(f[i - 1][j] +(a[i] == (i - j)),f[i - 1][j - 1]);
}
int ans = -1;
for(int i = 0;i <= n;i++) if(f[n][i] >= k){ans = i;break;}
di(ans);
}
return 0;
}
/**
* ┏┓ ┏┓+ +
* ┏┛┻━━━┛┻┓ + +
* ┃ ┃
* ┃ ━ ┃ ++ + + +
* ████━████+
* ◥██◤ ◥██◤ +
* ┃ ┻ ┃
* ┃ ┃ + +
* ┗━┓ ┏━┛
* ┃ ┃ + + + +Code is far away from
* ┃ ┃ + bug with the animal protecting
* ┃ ┗━━━┓ 神兽保佑,代码无bug
* ┃ ┣┓
* ┃ ┏┛
* ┗┓┓┏━┳┓┏┛ + + + +
* ┃┫┫ ┃┫┫
* ┗┻┛ ┗┻┛+ + + +
*/