제출 #918791

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
918791		vjudge1	Studentsko (COCI14_studentsko)	C++17	100 / 100	38 ms	572 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;

ll n,k;
pii q[N];
ll a[N],dp[2][N];


int main() {
	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;
	}
	for(int i=n; i>=1; i--) {
		for(int j=0; j<=n; j++) {
			dp[i%2][j] = dp[(i+1)%2][j];
			if(a[i] >= j) {
				dp[i%2][j] = max(dp[i%2][j],dp[(i+1)%2][a[i]]+1);
			}
			
		}
	}
	cout << n - dp[1][0] << endl;
}

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