이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<bits/stdc++.h> //:3
using namespace std;
typedef long long ll;
#define all(a) (a).begin(), (a).end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pi pair<int, int>
#define sz(x) (int)((x).size())
//#define int long long
const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};
const ll inf = 2e9;
const ll mod = 1e9 + 7;
const int N = 2e6 + 11;
const ll INF64 = 3e18 + 1;
const double eps = 1e-14;
const double PI = acos(-1);
//ifstream in(".in");
//ofstream out(".out");
int n, m, a[N], x, len[N];
void solve(){
cin >> n >> x;
vector<int> high;
for(int i = 1; i <= n; i++){
cin >> a[i];
auto it = lower_bound(all(high), a[i]);
if(it == high.end()){
high.push_back(a[i]);
len[i] = sz(high);
continue;
}
high[it - high.begin()] = a[i];
len[i] = it - high.begin() + 1;
}
int ans = 0;
vector<int> LSD;
for(int i = n; i > 0; i--){
auto it = lower_bound(all(LSD), -a[i]);
ans = (it == LSD.end() ? max(ans, len[i] + sz(LSD)) : max(ans, len[i] + (int)(it - LSD.begin())));
auto it1 = lower_bound(all(LSD), -a[i] - x);
if(it1 == LSD.end())LSD.push_back(-a[i] - x);else LSD[it1 - LSD.begin()] = -a[i] - x;
}
cout << ans << '\n';
}
int32_t main(){
ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
cout << setprecision(6) << fixed;
int T = 1;
//cin >> T;
while(T--){
solve();
}
}
# | 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... |