Submission #165131

#TimeUsernameProblemLanguageResultExecution timeMemory
165131Atill83Studentsko (COCI14_studentsko)C++14
100 / 100
5 ms636 KiB
#include <bits/stdc++.h> #define ff first #define ss second #define endl '\n' using namespace std; const long long INF = (long long) 1e9; const int mod = (int) 1e9+7; const int MAXN = (int) 5e3+5; typedef long long ll; typedef unsigned long long ull; typedef pair<int,int> pii; typedef pair<ll,ll> pll; ll n, k; int a[MAXN]; int b[MAXN]; map<int, int> blk; int dp[MAXN]; int arr[MAXN]; int main(){ ios_base::sync_with_stdio(false); cin.tie(nullptr);cout.tie(nullptr); #ifdef Local freopen("../IO/int.txt","r",stdin); freopen("../IO/out.txt","w",stdout); #endif cin>>n>>k; for(int i = 0; i < n; i++){ cin>>a[i]; b[i] = a[i]; } sort(b, b + n); for(int i = 0; i < n; i++){ arr[i] = INF; blk[b[i]] = i / k + 1; } arr[n] = INF; arr[0] = 0; for(int i = 0; i < n; i++){ a[i] = blk[a[i]]; } int ans = 0; for(int i = 0; i < n; i++){ int cur = a[i]; int ind = upper_bound(arr, arr + n + 1, cur) - arr; arr[ind] = cur; ans = max(ans, ind); //cout<<ind<<endl; } cout<<n - ans<<endl; #ifdef Local cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds "; #endif }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...