Submission #769184

#	Time	Username	Problem	Language	Result	Execution time	Memory
769184		raysh07	Global Warming (CEOI18_glo)	C++17	100 / 100	727 ms	68696 KiB

glo

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF (int)1e18
#define f first
#define s second
 
mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());
 
int n, x;
const int N = 2e5 + 69;
int seg[8 * N][2], a[N], dp[N][2], b[N];
map <int, int> mp;
set <int> st;
 
void upd(int l, int r, int pos, int qp, int v, int i){
    seg[pos][i] = max(seg[pos][i], v);
    if (l == r){
        return;
    }
    
    int mid = (l + r)/2;
    if (qp <= mid) upd(l, mid, pos*2, qp, v, i);
    else upd(mid + 1, r, pos*2 + 1, qp, v, i);
}
 
int query(int l, int r, int pos, int ql, int qr, int i){
    if (l >= ql && r <= qr) return seg[pos][i];
    else if (l > qr || r < ql) return 0;
    
    int mid = (l + r)/2;
    return max(query(l, mid, pos*2, ql, qr, i), query(mid + 1, r, pos*2 + 1, ql, qr, i));
}
 
void Solve() 
{
    cin >> n >> x;
    for (int i = 1; i <= n; i++){
        cin >> a[i];
        st.insert(a[i]);
        st.insert(a[i] + x);
    }
    
    int ptr = 0;
    for (auto x : st){
        mp[x] = ++ptr;
    }
    
    for (int i = 1; i <= n; i++){
        b[i] = a[i];
        a[i] = mp[a[i]];
    }
    
    int ans = 0;
    
    for (int i = 1; i <= n; i++){
        dp[i][0] = query(1, 2 * n, 1, 1, a[i] - 1, 0) + 1;
        dp[i][1] = query(1, 2 * n, 1, 1, a[i] - 1, 1) + 1;
        dp[i][1] = max(dp[i][1], query(1, 2 * n, 1, 1, mp[b[i] + x] - 1, 0) + 1);
        
        upd(1, 2 * n, 1, a[i], dp[i][0], 0);
        upd(1, 2 * n, 1, a[i], dp[i][1], 1);
        
        ans = max(ans, dp[i][0]);
        ans = max(ans, dp[i][1]);
    }
    
    cout << ans << "\n";
}
 
int32_t main() 
{
    auto begin = std::chrono::high_resolution_clock::now();
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
   // cin >> t;
    for(int i = 1; i <= t; i++) 
    {
        //cout << "Case #" << i << ": ";
        Solve();
    }
    auto end = std::chrono::high_resolution_clock::now();
    auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
    cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n"; 
    return 0;
}

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