제출 #918775

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
918775		vjudge1	학생 (COCI14_studentsko)	C++17	30 / 100	1 ms	600 KiB

studentsko

#include<bits/stdc++.h>
using namespace std;
#define ll int
#define pii pair<ll,ll>
#define pb push_back
#define fi first
#define se second

//const ll N = 5003;
const ll N = 25;

ll n,k;
pii q[N];
ll a[N],memo[N][N];

ll dp(ll x, ll y) {
	if(x == n+1) return 0;
	ll temp = memo[x][y];
	if(temp != -1) return temp;
	temp = dp(x+1,y);
	if(a[x] >= y) {
		temp = max(temp,dp(x+1,a[x])+1);
	}
	return memo[x][y] = temp;
}

int main() {
	memset(memo,-1,sizeof(memo));
	cin >> n >> k;
	for(int i=1; i<=n; i++) {
		cin >> q[i].fi;
		q[i].se = i;
	}
	sort(q+1,q+n+1);
	for(int i=1; i<=n; i++) {
		a[q[i].se] = (i-1)/k + 1;
	}
	cout << n - dp(1,0) << endl;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10