Submission #1311956

#	Time	Username	Problem	Language	Result	Execution time	Memory
1311956		hyyh	Global Warming (CEOI18_glo)	C++20	25 / 100	87 ms	4348 KiB

glo

#include <iostream>
#include <math.h>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <cstring>
#include <iomanip>
#include <set>
#include <bitset>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using piii = tuple<int,int,int>;
using pibii = tuple<int,bool,int,int>;
#define endl '\n'
#define f first
#define s second

int const INF = 1e9+10;

int main(){
    int n,m;cin >> n >> m;
    vector<int> lis = {0};
    vector<int> prefix;
    vector<int> lds = {-INF};
    vector<int> suffix;
    vector<int> arr;
    for(int i = 0;i < n;i++){
        int g;cin >> g;
        arr.emplace_back(g);
        auto it = lower_bound(lis.begin(),lis.end(),g);
        // for(auto k:lis) cout << k << " ";
        // cout << endl;
        if(it != lis.end()){
            *it = g;
            prefix.emplace_back(it-lis.begin());
        }
        else{
            prefix.emplace_back(lis.size());
            lis.emplace_back(g);
        }
    }
    for(int i = n-1;i >= 0;i--){
        int g = -arr[i];
        auto it = lower_bound(lds.begin(),lds.end(),g);
        // for(auto k:lds) cout << k << " ";
        // cout << endl;
        if(it != lds.end()){
            *it = g;
            suffix.emplace_back(it-lds.begin());
        }
        else{
            suffix.emplace_back(lds.size());
            lds.emplace_back(g);
        }
    }
    reverse(suffix.begin(),suffix.end());
    // for(auto k:prefix) cout << k << " ";
    // cout << endl;
    // for(auto k:suffix) cout << k << " ";
    // cout << endl;
    int ans = 1;
    for(int i = 0;i < n-1;i++){
        //cout << arr[i] << ans << endl;
        if(arr[i] < arr[i+1]+m){
            ans = max(ans,prefix[i]+suffix[i+1]);
        }
    }
    cout << ans;
}

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