제출 #885321

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
885321		ByeWorld	Global Warming (CEOI18_glo)	C++14	62 / 100	59 ms	12192 KiB

glo

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops")
#define bupol __builtin_popcount
#define int long long 
#define ll long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
using namespace std;
const int MAXN = 3e5+20;
const int LOG = 60;
const int MOD = 998244353;
const int SQRT = 520;
const int INF = 1e18;
typedef pair<int,int> pii;
typedef pair<pii,int> ipii;
 
int n, x;
int a[MAXN], pr[MAXN], su[MAXN], num[MAXN], nus[MAXN];
vector <int> vec;
 
signed main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n >> x;
    for(int i=1; i<=n; i++) cin >> a[i];
    for(int i=1; i<=n; i++){
        auto it = lower_bound(vec.begin(), vec.end(), a[i]);
        if(it == vec.end()){
            vec.pb(a[i]);
        } else {
            int id = it - vec.begin();
            vec[id] = a[i];
        }
        pr[i] = vec.size();
        num[i] = vec.back(); 
    }
    //for(int i=1; i<=n; i++) cout << pr[i] << " \n"[i==n];

    int ans = pr[n];
    vec.clear();

    for(int i=n; i>=2; i--){
        auto it = lower_bound(vec.begin(), vec.end(), -a[i]-x);
        if(it == vec.end()){
            vec.pb(-a[i]-x);
        } else {
            int id = it - vec.begin();
            vec[id] = -a[i]-x;
        }
        su[i] = vec.size();
        nus[i] = -vec.back();

        it = lower_bound(vec.begin(), vec.end(), -num[i-1]);
        // cout << i << " i\n";
        // for(auto in : vec) cout << in << "in";
        //     cout << " vec" << (it-vec.begin()) << "\n";
        ans = max(ans, pr[i-1]+(int)(it-vec.begin()));
    }

    vec.clear();
    for(int i=1; i<=n-1; i++){
        auto it = lower_bound(vec.begin(), vec.end(), a[i]);
        if(it == vec.end()){
            vec.pb(a[i]);
        } else {
            int id = it - vec.begin();
            vec[id] = a[i];
        }
        
        it = lower_bound(vec.begin(), vec.end(), nus[i+1]);
        ans = max(ans, su[i+1]+(int)(it-vec.begin()));
    }
    cout << ans << '\n';
}

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