Submission #1138673

#	Time	Username	Problem	Language	Result	Execution time	Memory
1138673		LCJLY	Studentsko (COCI14_studentsko)	C++20	100 / 100	1 ms	328 KiB

studentsko

#include <bits/stdc++.h>
using namespace std;
 
//#define int long long 
#define ld long double
#define show(x,y) cout << y << " " << #x << endl;
#define show2(x,y,i,j) cout << y << " " << #x << "  " << j << " " << #i << endl;
#define show3(x,y,i,j,p,q) cout << y << " " << #x << "  " << j << " " << #i << "  " << q << " " << #p << endl;
#define show4(x,y) for(auto it:y) cout << it << " "; cout << #x << endl;
typedef pair<int,int>pii;
typedef pair<int,pii>pi2;
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());

int n,k;
int arr[5005];

void solve(){
	cin >> n >> k;
	
	vector<int>v;
	for(int x=0;x<n;x++){
		cin >> arr[x];
		v.push_back(arr[x]);
	}
	
	sort(v.begin(),v.end());
	
	vector<pii>v2;
	for(int x=0;x<n;x++){
		int index=lower_bound(v.begin(),v.end(),arr[x])-v.begin();
		arr[x]=index/k;
	}
	
	int dp[5005];
	int ptr=0;
	for(int x=0;x<n;x++){
		int index=upper_bound(dp,dp+ptr,arr[x])-dp;
		dp[index]=arr[x];
		ptr=max(ptr,index+1);
	}
	
	cout << n-ptr << "\n";
}
 
int32_t main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	//freopen("in.txt","r",stdin);
	//freopen("in.txt","w",stdout);
	int t=1;	
	//cin >> t;	
	while(t--){
		solve(); 
	}
}

• 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