이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#define sze(x) (ll)x.size()
#define idx(x, a) get<x>(a)
#define pb push_back
#define fi first
#define se second
using namespace std;
typedef long long ll;
const ll MAXN = 5e3 + 3;
const ll INF = 1e18 + 7;
ll a[MAXN], n, k, b[MAXN], res, lis[MAXN];
int main()
{
ios_base::sync_with_stdio(0); cout.tie(0);
#ifdef OFFLINE
freopen("input.inp", "r", stdin);
#endif
cin >> n >> k;
for (ll i = 1; i <= n; ++i) { cin >> a[i]; b[i] = a[i]; }
sort(b + 1, b + n + 1); a[0] = -INF;
for (ll i = 1; i <= n; ++i) a[i] = (lower_bound(b + 1, b + n + 1, a[i]) - b - 1) / k;
fill(lis, lis + n + 1, INF); lis[0] = -INF;
for (ll i = 1; i <= n; ++i)
{
ll r = upper_bound(lis, lis + n + 1, a[i]) - lis;
res = max(res, r);
lis[r] = a[i];
}
cout << n - res;
}
# | 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... |