이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<bits/stdc++.h>
using namespace std;
#define Study ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define fori for(ll i=0;i<n;i++)
#define ins insert
void work(){
ll n,k;
cin>>n>>k;
vector<ll>a(n+1);
vector<ll>ca(n+1);
vector<ll>dp(n+1,1);
map<ll,ll>m;
for(ll i=1;i<=n;i++){
cin>>a[i];
ca[i]=a[i];
}
sort(a.begin(),a.end());
for(ll i=1;i<=n;i++){
ll ans=i/k;
if(i%k!=0)
ans++;
m[a[i]]=ans;
}
ll ans=0;
for(ll i=1;i<=n;i++){
for(ll j=1;j<i;j++){
if(m[ca[i]]>=m[ca[j]]){
dp[i]=max(dp[i],dp[j]+1);
}
}
ans=max(ans,dp[i]);
}
cout<<n-ans;
}
int main(){
Study;
ll t=1;
//cin>>t;
while(t--){
work();
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |