This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
const int mxN = 2e5+5;
int n, x, arr[mxN];
pii lis[mxN], inlis[mxN];
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> n >> x;
vector<int> temp;
for(int i = 1; i <= n; ++i) {
cin >> arr[i];
auto itr = lower_bound(temp.begin(), temp.end(), arr[i]);
if(itr == temp.end())
temp.emplace_back(arr[i]);
else
*itr = arr[i];
lis[i] = {temp.size(), temp[temp.size()-1]};
}
temp.clear();
for(int i = n; i >= 1; --i) {
auto itr = lower_bound(temp.begin(), temp.end(), -arr[i]);
if(itr == temp.end())
temp.emplace_back(-arr[i]);
else
*itr = -arr[i];
inlis[i] = {temp.size(), temp[temp.size()-1]};
// cout << inlis[i].first << ' ' << inlis[i].second << '\n';
}
int ans = 0;
for(int i = 1; i <= n; ++i) {
for(int j = i+1; j <= n; ++j) {
if(lis[i].second - x < -inlis[j].second) {
ans = max(ans, lis[i].first + inlis[j].first);
}
}
}
cout << ans;
}
# | 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... |