Submission #51552

#	Time	Username	Problem	Language	Result	Execution time	Memory
51552		tranxuanbach	Studentsko (COCI14_studentsko)	C++17	100 / 100	55 ms	1984 KiB

studentsko

#include<bits/stdc++.h>
#define dibs reserve
#define OVER9000 1234567890
#define ALL_THE(CAKE,LIE) for(auto LIE =CAKE.begin(); LIE != CAKE.end(); LIE++)
#define tisic 47
#define soclose 1e-8
#define chocolate win
// so much chocolate
#define patkan 9
#define ff first
#define ss second
#define abs(x) ((x < 0)?-(x):x)
#define uint unsigned int
#define dbl long double
using namespace std;
// mylittledoge
 
int main(){
	cin.sync_with_stdio(0);
	cin.tie(0);
	int N, K;
	cin >> N >> K;
	vector <int> A(N);
	map <int, int> M;
	for (int i = 0; i < N; i++){
		cin >> A[i];
		M[A[i]] = 0;
	}
	int n = 0;
	ALL_THE(M,it) it->ss = n++;
	for (int i = 0; i < N; i++){
	    A[i] = M[A[i]] / K;
	}
	int ansT = 0;
	vector <int> ans(N, 1);
	for (int i = 0; i < N; i++){
		for (int j = 0; j < i; j++){ 
			if (A[j] <= A[i]) ans[i] = max(ans[i], ans[j] + 1);
		}
		ansT = max(ansT, ans[i]);
	}
	cout << N - ansT << "\n";
	return 0;
}

• 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