제출 #1216370

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1216370		Robert_junior	Studentsko (COCI14_studentsko)	C++20	100 / 100	31 ms	744 KiB

studentsko

#include<bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define ins insert
#define pb push_back
#define F first
#define S second
const int N = 1e6 + 7, M = 5e5 + 7;
const int mod = 1e9 + 7;
int a[N], b[N], dp[N];
void solve(){
    int n, k;
    cin>>n>>k;
    map<int, int>mp;
    for(int i = 1; i <= n; i++){
        cin>>a[i];
        b[i] = a[i];
    }
    sort(b + 1, b + n + 1);
    for(int i = 1; i <= n; i++){
        mp[b[i]] = (i + k - 1) / k;
    }
    for(int i = 1; i <= n; i++){
        a[i] = mp[a[i]];
    }
    int ans = 0;
    for(int i = 1; i <= n; i++){
        for(int j = 1; j < i; j++){
            if(a[j] <= a[i]){
                dp[i] = max(dp[i], dp[j]);
            }
        }
        dp[i]++;
        ans = max(ans, dp[i]);
    }
    cout<<n - ans;
}
signed main(){
    ios_base :: sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    //cin>>t; 
    for(int i = 1; i <= t; i++){
        //cout<<"Case "<<i<<": ";
        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