이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define int long long
const int N = 2e5 + 69;
int n, a[N], x, dp[N];
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int tt = 1;
//cin >> tt;
while (tt--) {
cin >> n >> x;
for (int i = 1;i <= n;i++)
cin >> a[i];
int ans = 1;
auto Solve = [&](vector<int> a) {
int r = 0;
vector<int> dp(n, 1e9);
for (int i = 0;i < n;i++) {
auto u = lower_bound(dp.begin(), dp.end(), a[i]) - dp.begin();
if (dp[u] == 1e9)
r++;
dp[u] = a[i];
}
return r;
};
for (int i = 1;i <= n;i++) {
vector<int> b;
for (int j = 1;j <= n;j++)
b.push_back(a[j]);
for (int j = 1;j <= i;j++)
b[j - 1] -= x;
ans = max(ans, Solve(b));
}
cout << ans << '\n';
}
return 0;
}
# | 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... |