Submission #957072

#	Time	Username	Problem	Language	Result	Execution time	Memory
957072		Charizard2021	Global Warming (CEOI18_glo)	C++17	100 / 100	92 ms	4624 KiB

glo

#include<bits/stdc++.h>
using namespace std;
int main(){
    int n, x;
    cin >> n >> x;
    int a[n];
    for(int i = 0;i < n; i++) cin >> a[i];
    int prefLongest[n];
    vector<int> dp;
    for(int i = 0; i < n; i++){
        int idx = lower_bound(dp.begin(), dp.end(), a[i]) - dp.begin();
        if(idx == (int)dp.size()){
            dp.push_back(a[i]);
            prefLongest[i] = (int)dp.size();
        }
        else{
            dp[idx] = a[i];
            prefLongest[i] = idx + 1;
        }
    }
    deque<int> dp2;
    int ans = 0;
    for(int i = n - 1; i >= 0; i--){
        int idx = upper_bound(dp2.begin(), dp2.end(), a[i] - x) - dp2.begin();
        idx--;
        // cout << (int)dp2.size() - idx - 1 << "\n";
        ans = max(ans, (int)dp2.size() - idx - 1 + prefLongest[i]);
        int idx2 = upper_bound(dp2.begin(), dp2.end(), a[i]) - dp2.begin();
        idx2--;
        if(idx2 == -1){
            dp2.push_front(a[i]);
        }
        else{
            dp2[idx2] = a[i];
        }
    }
    cout<< ans << "\n";
}

• 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