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 int long long
#define pii pair<int,int>
#define fi first
#define se second
#define pb push_back
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,x;
cin >>n >> x;
vector<int>v(n);
for(int i = 0; i < n; i++){
cin >>v[i];
}
vector<int>dp(n+3,LLONG_MAX);
dp[0] = 0;
int maxi = 0;
for(int i = 0;i < n; i++){
int j = lower_bound(dp.begin(), dp.end(), v[i]+x)-dp.begin();
maxi = max(maxi, j);
dp[j] = v[i]+x;
dp[lower_bound(dp.begin(), dp.end(), v[i])- dp.begin()] = v[i];
//cout << dp;
}
cout << maxi;
}
# | 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... |