이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
size_t n;
int64_t x;
cin >> n >> x;
vector<int64_t> t(n);
for (int64_t &y : t)
cin >> y;
reverse(t.begin(), t.end());
vector<int64_t> dp;
vector<size_t> lis_after(n);
for (size_t i = 0; i < n; i++)
{
auto it = lower_bound(dp.begin(), dp.end(), t[i], greater<int64_t>());
lis_after[n - 1 - i] = it - dp.begin() + 1;
if (it == dp.end())
dp.push_back(t[i]);
else
*it = t[i];
}
reverse(t.begin(), t.end());
dp.clear();
size_t max_lis = 0;
for (size_t i = 0; i < n; i++)
{
auto it = lower_bound(dp.begin(), dp.end(), t[i] + x);
max_lis = max(max_lis, it - dp.begin() + lis_after[i]);
it = lower_bound(dp.begin(), dp.end(), t[i]);
if (it == dp.end())
dp.push_back(t[i]);
else
*it = t[i];
}
cout << max_lis << '\n';
}
# | 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... |