Submission #1109816

#TimeUsernameProblemLanguageResultExecution timeMemory
1109816SzBenceGlobal Warming (CEOI18_glo)C++17
27 / 100
35 ms3576 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...