Submission #1215266

#	Time	Username	Problem	Language	Result	Execution time	Memory
1215266		nikaa123	Global Warming (CEOI18_glo)	C++20	0 / 100	18 ms	2628 KiB

glo

#include <bits/stdc++.h>
using namespace std;
 
// #define int long long
#define eb emplace_back
#define mp make_pair
#define pb push_back
#define pp pop_back
#define endl '\n'
#define ff first
#define ss second
#define stop exit(0)
#define sz(x) (int)x.size()
#define pause system("pause")
#define all(x) (x).begin(),(x).end()
#define deb(x) cout << #x << "-" << x  << endl
 
typedef char chr;
typedef string str;
typedef long long ll;
typedef vector <int> vii;
typedef pair <int,int> pii;

const long long INF = LLONG_MAX;
const int inf = INT_MAX;
const int mod = 998244353;
const int MOD = 1e9 + 7;
const int dx[] = {0,0,-1,1};
const int dy[] = {-1,1,0,0};
const double PI = 2 * acos(0.0);
 
const int N = 2e5 + 5;

int n,d;
int p[N];
int a[N];
vii dp(N,inf);
int ans;


inline void test_case() {
        
    cin >> n >> d;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        a[i] = -a[i];
    }
    dp[0] = -inf;
    for (int i = n; i >= 1; i--) {
        auto it = lower_bound(all(dp),a[i]);
        int ind = (it - dp.begin())+1;
        dp[ind] = a[i];
        p[i] = ind; 
    }
    dp[0]=-inf;
    for (int i = 1; i <= n; i++) {
        a[i] = -a[i];
        // a[i] -= abs(d);
        dp[i] = inf;
    }
    ans = -inf;
    for (int i = 1; i <= n; i++) {
        auto it = lower_bound(all(dp),(a[i]+abs(d)));
        int ind = it - dp.begin()+1;
        ans = max(ans,p[i]+ind-1); 
        it = lower_bound(all(dp),a[i]);
        ind = it-dp.begin()+1;
        dp[ind] = a[i];
        
    }
    cout << ans << endl;
}

 
signed main () {
    ios_base :: sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    
    int T = 1;
    // cin >> T;
    while(T--) {
        test_case();
    }
    
    return 0;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 10
• Subtask 3: 0 / 13
• Subtask 4: 0 / 10
• Subtask 5: 0 / 20
• Subtask 6: 0 / 17
• Subtask 7: 0 / 25