제출 #492979

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
492979		niloyroot	Studentsko (COCI14_studentsko)	C++14	100 / 100	48 ms	496 KiB

studentsko

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<ll>;
using pl = pair<ll,ll>;
#define pb push_back
#define form(m,it) for(auto it=m.begin(); it!=m.end(); it++)
#define forp(i,a,b) for(ll i=a; i<=b; i++)
#define forn(i,a,b) for(ll i=a; i>=b; i--)
#define newl '\n'
#define ff first
#define ss second
const ll mod = 998244353;

void solve(){
    ll n,k; cin>>n>>k;
    pl v[n];
    forp(i,0,n-1){
        cin>>v[i].ff; v[i].ss=i;
    }
    sort(v, v+n);
    ll a[n];
    forp(i,0,n-1){
        a[v[i].ss]=i/k;
    }

    ll dp[n];
    ll mx={0};
    forp(i,0,n-1){
        dp[i]=1;
        forp(j,0,i-1){
            if(a[i]>=a[j]){
                dp[i]=max(dp[i],dp[j]+1);
            }
        }
        mx=max(mx,dp[i]);
    }

    cout<<n-mx<<newl;
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    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